acceptodds
Under review as a conference paper at ICLR 2027

RIFT: Rectified log-Intensity Flows for Temporal Point Processes

Abstract

Generative modeling of temporal point processes (TPPs) has been extensively studied. Existing approaches—autoregressive models and diffusion-based models—typically operate on individual event times, which exposes them to error accumulation and limits their ability to capture global dependencies across the sequence. We propose RIFT (Rectified log-Intensity Flow TPPs), a generative framework that directly learns a velocity field over log-intensity functions, transforming a tractable base intensity (a homogeneous Poisson process) into the target intensity via a continuous ODE. Operating in log space guarantees that intermediate intensities remain non-negative throughout the transport path. A straightness loss further encourages the learned trajectories to be straight in log-intensity space, reducing the number of ODE steps required at inference from the 100 steps typical of diffusion-based methods to as few as K = 5. Experiments on 13 benchmark datasets demonstrate that RIFT achieves competitive log-likelihood while offering substantial improvements in sampling efficiency over autoregressive and diffusion-based baselines.

Primary area:
generative models
Keywords:
Flow matching, temporal point process

Reviews

Among:
Shape:
1234this paper, Bottom 10%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 1.67 over 3 reviews, above 10% of the others.
Reviewer_7ZjbOpenReview ↗
Rating
1
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposes RIFT, a non-autoregressive generative model for unmarked, univariate temporal point processes. The method constructs a linear interpolation between data and reference intensities in log-intensity space. A Transformer predicts the log-intensity velocity conditioned on the current event set, and sampling proceeds through event thinning and superposition.

Critical strengths

Log-intensity parameterization naturally preserves positivity, while thinning and superposition accommodate variable event counts without requiring event alignment. The predicted intensity profiles are also available throughout generation, making the model’s behavior easier to inspect.

Critical weaknesses
  1. The standard thinning/superposition result does not directly justify the event-dependent transitions used by RIFT.

The standard result states that, given an input Poisson process with intensity λ(t)\lambda(t) and a fixed positive scaling function ω(t)\omega(t), independently retaining each event with probability min⁡(ω(t),1)\min(\omega(t),1) and superposing an independent Poisson process with intensity max⁡(ω(t)−1,0)λ(t)\max(\omega(t)-1,0)\lambda(t) produces a Poisson process with intensity λ(t)ω(t)\lambda(t)\omega(t).

In Algorithm 2, however, the scaling function is predicted by vϕ(er,r,t)v_\phi(e_r,r,t) from the same current event set being transformed. Conditioning on this predicted function therefore provides information about the input events, and the input is no longer guaranteed to retain its original Poisson distribution. Appendix A invokes the standard theorem without establishing this required property. Consequently, starting from a homogeneous Poisson process does not by itself justify the claim that every subsequent backward step remains Poisson with the tracked intensity.

  1. The empirical improvements over the strongest existing methods are limited and uneven.

Although RIFT is competitive, the results do not demonstrate a consistent advantage over the strongest baselines. In Table 1, its reported mean MMD is higher than EdiTPP’s on seven of the thirteen datasets. In forecasting, RIFT achieves the lowest mean MARE on two of seven datasets.

The five-step sampler could offer a practical advantage, but the paper does not compare competing methods’ runtimes on the same hardware. Thus, the experiments establish competitiveness without clearly demonstrating a substantial improvement in accuracy or the accuracy–efficiency tradeoff. This limits the empirical justification for adopting the proposed framework.

Questions for authors
  1. Under the Poisson/Cox interpretation discussed in Section 4.6 and Appendix H, which temporal dependencies can the model faithfully reproduce? In particular, how should its competitive MMD on the self-correcting dataset be interpreted alongside the substantial discrepancy in generated count dispersion shown in Figure 5?

  2. Since the kernel bandwidth determines the forward noising path, could the authors provide quantitative sensitivity results across bandwidths, particularly for sparse sequences and rapidly varying intensities?

2 comments

W1 (thinning theorem).

We thank the reviewer; this is correct. Remark 3.1 requires the scaling function to be independent of the events being thinned. In Algorithm 2, ω(t)\omega(t) is computed from erke_{r_k} itself, so each backward step is a dependent thinning followed by an independent Poisson superposition, and erk−1e_{r_{k-1}} is not in general PP(λrk−1)\text{PP}(λ_{r_{k-1}}).

However, it is noted that the training process is correct and the experiments remains unchanged. We will update the corresponding interpretations about the denoised output sequence.

In the revision: (1) Remark 3.1 is restricted to scaling functions that do not depend on the input set, which covers the forward chain started from e0e_0 and an event-independent velocity. (2) A new proposition states the backward step as it is: given (erk,λrk(t))(e_{r_k}, \lambda_{r_k}(t)), an independent Bernoulli selection of erke_{r_k} united with an independent PP(ω(t)λrk(t))\text{PP}(\omega(t)\lambda_{r_k}(t)); λrk(t)\lambda_{r_k}(t) is the model's predicted intensity, not the law of erke_{r_k}. (3) We removed "exact" for backward transitions and intensity tracking throughout.

W2 (empirical gains).

The proposed RIFT supports "competitive" performance, when comparing with the SOTA EdiTPP. Against EdiTPP in Table 1, RIFT's mean MMD is higher on 7 datasets, tied on 2 (H2, RP) and lower on 4 (MRP, RedditC, RedditS, Yelp2); in forecasting its MARE is lowest on two of seven, as you note. RIFT is at or below the train-vs-test MMD on 8 of 13 datasets (EdiTPP: 9). Baselines are copied from their papers (different sample sizes and checkpoint selection), so small gaps cannot be read either way.

The advantages of the proposed RIFT can be listed as: positive intensities, events inserted and deleted rather than moved, a predicted intensity at each step (Fig. 2), K = 5 steps (Add-Thin 100; EventFlow 25 function evaluations).

Q1 (dependencies).

From experimental results, we can see that non-stationary rate profiles (Taxi) and over-dispersed counts on Hawkes1, the latter largely supplied by the moment-matched reference rate (count variance matched to the data by construction, App. B): variance/mean is 25.72 with it and 3.08 with a global rate (an event-independent velocity would give 1, so the dependence is active); the data have 19.40.

We leave the connection to Hawkes processes to future work. As a result, there are not experiment tests inhibition or the conditional structure of self-excitation.

Q2 (bandwidth).

We have verified that RIFT is insensitive to the choice of kernel bandwidth hh by varying 0.25h,0.5h,h,2h,4h0.25h, 0.5h, h, 2h, 4h on Hawkes1 and Taxi. Across all five settings, the MMD of RIFT varies by at most 0.050.05 on Hawkes1 and 0.040.04 on Taxi, confirming that the forward process is robust to the quality of the kernel intensity estimate.

Thank you for your response. The changes in the revised manuscript are difficult to identify because they have not been highlighted. In my view, the manuscript requires substantial revision, particularly with respect to the design of the method based on thinning theory. I am therefore maintaining my current score.

Reviewer_ej1LOpenReview ↗
Rating
2(−1)
Confidence
2
Informativeness
2
Presentation
3
Soundness
3
Read review
Paper summary

The authors propose a very efficient flow model that transforms the intensity function rather than the event points themselves.

Critical strengths
  • Flow-based models are a natural choice here, although the paper does not fully motivate when generating entirely new event sequences from scratch is practically useful.
  • The main caveats are acknowledged and demonstrated.
  • The geometry of rectified flows is well matched to the algebra of Poisson processes.
  • The evaluation is very broad and convincing.
  • The repository seems sound (although I have not reproduced the results).
Critical weaknesses
  • Main weakness: RIFT is limited by its conditionally Poisson/Cox-process structure, which restricts the types of TPPs it can represent dramatically. The paper acknowledges this somewhat but since this is a fundamental limitation of the method, it should be discussed and stated more clearly, ideally already in the abstract.
  • The limitations should be discussed in more detail.
  • The discussion of "exact" transitions risks conflating exactness of the thinning operation conditional on an intensity with correctness. Competing diffusion/flow approaches may define equally valid generative distributions despite operating directly on event sets or event times. That should be clarified better.
  • The error accumulation argument for autoregressive models is not fully convincing to me. I suspect it is more nuanced than indicated in the paper. Errors can also propagate in non-autoregressive models by changing later likelihoods.
  • The motivation is significanly underdeveloped. The paper mentions applications in healthcare and neuroscience, but does not clearly explain why generating new event sequences is an important problem in these domains (I suspect it is not). Much of the motivation seems to rely on an existing but still fairly small literature on diffusion and flow-based TPP generation. This should be clarified.
  • The restriction to unmarked, univariate processes substantially limits the scope. Extending the method to marked TPPs seems relatively natural and would make both the evaluation and the practical relevance much stronger.
Questions for authors
  • What is the practical motivation for generating entirely new TPP sequences, especially in applications such as healthcare or neuroscience?
  • Could the authors clarify how RIFT differs conceptually from existing diffusion-based TPP methods, and in what sense its transitions are more "exact"?
  • How difficult would it be to extend RIFT to marked TPPs, and do the authors expect the method to retain its advantages?
1 comment

W1 (Cox structure, abstract) / W2 (limitations).

We agree the scope belongs in the abstract and main text. We will update this in the accepted version.

W3 / Q2 ("exact"; difference from diffusion-based TPPs).

The conceptual difference between the proposed RIFT and diffusion-based TPPs is what is parameterised and transported. RIFT's network outputs the velocity of a log-intensity function at any query time given the current event set; the sampler accumulates it into an explicit predicted intensity that drives thinning and superposition.

Add-Thin also adds and thins, but learns a classifier for kept events and an intensity model for removed ones to reverse its forward process; EventFlow transports event times for a sampled number of events; EdiTPP learns a flow of insertions, deletions and substitutions. Unlike Add-Thin, RIFT's loss has no term matching its backward kernel to its forward chain (limitation (ii)). We will remove the "exact" wording throughout and rewrite the comparison in Sec. 2.

W4 (error accumulation).

The paper overstates this. RIFT's K steps are sequential too: an error in an early backward step changes the event set and the tracked intensity that every later step conditions on. The supportable claim concerns cost: most autoregressive samplers need one sequential network evaluation per event, RIFT K = 5 sequential steps whatever the sequence length. We will remove the error-accumulation claims (abstract, Sec. 1, App. H) and keep only the statement about sequential evaluations.

W5 / Q1 (motivation).

We do not claim that generating entirely new sequences is itself a goal in healthcare or neuroscience; those citations motivate TPP modelling in general. In the paper, generation has two roles. Unconditional generation is the evaluation protocol of the benchmark we follow (Shchur et al., 2020b; Lüdke et al., 2023): samples are compared with held-out sequences, which measures how well a model fits the distribution of sequences without needing a tractable likelihood. The application-facing task is conditional: forecasting the events in a future window given the history (Sec. 4.3). We will rewrite the introduction to say this and to separate TPP applications from the generation task.

W6 / Q3 (marked TPPs).

Extending to marked TPPs is natural in methodologies but not implemented. For categorical marks we can introduce mark embedding to each event's time embedding, and output one velocity per mark at each query time. The open issues we foresee are per-mark kernel estimates and reference rates when some marks have few events, and whether five steps still suffice. We will describe this as future work in the Limitations section.

Reviewer_doVPOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposes RIFT (Rectified log-Intensity Flows for Temporal point processes), which generates a whole event sequence by transporting a homogeneous Poisson intensity to the data intensity along a straight path in log-intensity space. The experimental results demonstrate that RIFT consistently perform best or nearly best in terms of the the kernel density and forecasting tasks.

Critical strengths
  1. The core idea is interesting. When applying rectified flow to temporal point processes (TPPs), the proposed method transports the log-intensity function rather than the event points themselves. The events are only added or removed during the process, rather than undergoing continuous perturbation. This approach differs from the transport targets used in Add-Thin, EventFlow, and EditTPP, and the problem formulation is clear. The scaled-sampling and intensity tracking are the highlights of the method.
  2. The experiments in the paper are quite comprehensive, and the results are competitive.
Critical weaknesses
  1. The training objective LIIL_{II} is a sequence-specific surrogate likelihood, rather than the true marginal likelihood. Eq. 5 employs forward chains {erk}\{e_r^k\} derived from the sequence itself. These chains are independent of ϕ\phi and originate from kernel estimation. Although the velocity network never encounters λ0^(t)\hat{\lambda_{0}}(t), the training objective nonetheless relies on these noisy chains. Consequently, it remains unclear to what extent optimizing LIIL_{II} is truly equivalent to maximizing the log-likelihood of the observed data or minimizing the KL divergence relative to the data distribution.
  2. The method assumes that, given a specific intensity sequence, events are generated by a Poisson process. Furthermore, each step of the "Scaled-Sampling" procedure preserves the Poisson/Cox structure, conditional on the set of events from the preceding step. This implies that the resulting distribution aligns more closely with the class of Cox (or mixed Poisson) processes, where events are conditionally independent given the intensity. Can this approach represent the self-exciting or inhibitory dynamics characteristic of Hawkes processes? The main text does not sufficiently characterize which classes of processes can—or cannot—be represented by this framework.
  3. In prediction tasks of temporal point process, conditional intensity should generally depend on historical events. Whether the historical conditioning in RIFT is sufficiently robust warrants further explanation and ablation analysis.
Questions for authors
  1. Please clarify the relationship between LIIL_{II} and the true marginal log-likelihood of the observed sequence.
  2. The forward process employs a kernel estimate, λ^0(t)\hat{\lambda}_0(t). How should the kernel bandwidth be selected?
  3. Historical information is injected solely via conditioning embeddings, and the generation process within the window proceeds identically to unconditional density estimation. Is this form of conditioning sufficient for data that is self-exciting or exhibits strong historical dependence? Could the authors provide ablation studies that isolate the effects of modifying the history encoder or the reference rate?
  4. Scaled-Sampling requires evaluating the intensity function in continuous time. How is a 1000-point grid utilized during the actual sampling process? Furthermore, how do the grid resolution, the parameter KK, the number of queries QQ, and other important parameters affect the experimental results?
  5. Can the final distribution generated by RIFT represent a Hawkes process or other more complex temporal point process distributions?
2 comments

W1 / Q1. clarify the relationship training objective LllL_{ll} and the true marginal log-likelihood

LllL_{ll} is a surrogate of the true marginal log-likelihood and maximizing LllL_{ll} is truly equivalent to maximizing the log-likelihood of the observed data. LllL_{ll} can be understood as approximating the true log-likelihood λ0(t)\lambda_0(t) through λ0(t)≈λ1exp⁡(∫10vϕ(er,r,t)dr)\lambda_0(t)\approx\lambda_1\exp(\int_1^0v_{\phi}(e_r, r, t)dr). When comparing to the diffusion model, LllL_{ll} works similar as the negative reconstruction error, in which the noise (constant intensity λ1\lambda_1 from a homogeneous Poisson process) is gradually denoised into the true date (true intensity function). Similar comparison is also provided in Table 6.

W2 / Q5. Connection to the self-exciting or inhibitory dynamics characteristic of Hawkes processes

The current work is focusing on the class of Cox (or mixed Poisson) processes. We leave the connection to Hawkes processes to future work.

W3 / Q3. Historical information is injected solely via conditioning embeddings. The ablation studies of modifying the history encoder or the reference rate

We follow the common settings (e.g., Add-Thin) to inject historical information via conditioning embeddings. As a short ablation study, we have modified the history encoder and obtain the following results:

PUBGRedditCRedditSTaxiTwitterYelp1Yelp2
RNN,λ1\lambda_10.390.470.200.440.240.280.43
RNN,0.25$\lambda_1$0.560.590.210.480.470.410.49
RNN,4$\lambda_1$0.440.460.220.530.310.450.44
MLP,λ1\lambda_10.440.480.230.550.230.340.46
Transformer,λ1\lambda_10.380.490.180.420.250.280.45

From this pilot study, we can see that significantly changing the reference rate may reduce the forecasting capabilities, whereas MLP or transformer encoder of the historical events may have limited influence on the forecasting capabilities.

Q2. How should the kernel bandwidth be selected?

We have provided the hyperparameter of kernel bandwidth in Table 8. We have verified that RIFT is insensitive to the choice of kernel bandwidth hh by varying 0.25h,0.5h,h,2h,4h0.25h, 0.5h, h, 2h, 4h on Hawkes1 and Taxi. Across all five settings, the MMD of RIFT varies by at most 0.050.05 on Hawkes1 and 0.040.04 on Taxi, confirming that the forward process is robust to the quality of the kernel intensity estimate.

Thank you for your response. After carefully reviewing the authors' rebuttal and the comments from other reviewers, I decide to keep the rating.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.