- 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
- 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 and a fixed positive scaling function , independently retaining each event with probability and superposing an independent Poisson process with intensity produces a Poisson process with intensity .
In Algorithm 2, however, the scaling function is predicted by 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.
- 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
-
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?
-
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
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.
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) is computed from erk itself, so each backward step is a dependent thinning followed by an independent Poisson superposition, and erk−1 is not in general PP(λrk−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 e0 and an event-independent velocity. (2) A new proposition states the backward step as it is: given (erk,λrk(t)), an independent Bernoulli selection of erk united with an independent PP(ω(t)λrk(t)); λrk(t) is the model's predicted intensity, not the law of erk. (3) We removed "exact" for backward transitions and intensity tracking throughout.
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).
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.
We have verified that RIFT is insensitive to the choice of kernel bandwidth h by varying 0.25h,0.5h,h,2h,4h on Hawkes1 and Taxi. Across all five settings, the MMD of RIFT varies by at most 0.05 on Hawkes1 and 0.04 on Taxi, confirming that the forward process is robust to the quality of the kernel intensity estimate.