- Rating
- 3(+2)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper proposes an amortized variational framework for inferring a latent intensity function shared across replicated temporal point patterns. A permutation-invariant encoder maps a variable number of inhomogeneous Poisson process realizations to a latent distribution, which is decoded into a distribution over continuous-time intensity functions. The model is trained with a variational objective (ELBO) that uses only event times and the point process likelihood, enabling fast inference on new tasks without per-task optimization. Synthetic and real-data experiments evaluated intensity recovery, uncertainty quantification, and adaptation to additional realizations, showing that the proposed method outperformed the baselines compared in intensity recovery and held-out likelihood.
Critical strengths
- The paper addresses a practically relevant problem: fast inference of a shared latent intensity from replicated point process observations, avoiding costly per-task optimization at test time.
- The proposed framework is conceptually simple and well structured, combining permutation-invariant pooling with a neural process-based conditional variational objective and point process likelihood training.
- The effectiveness of the proposed method was demonstrated on synthetic and real-world data.
Critical weaknesses
- The novelty of treating multiple replicated realizations as a distinct inference setting is unclear. Under the paper’s assumption that the realizations are conditionally independent inhomogeneous Poisson processes sharing the same intensity, the replicated-observation setting appears to reduce directly to standard intensity inference with a known exposure factor . The superposition of independent realizations with shared intensity is a single inhomogeneous Poisson process with intensity . This suggests that existing amortized intensity-inference methods, such as deep random splines and potentially neural diffusion intensity models, could be adapted to the present setting by incorporating into the observation likelihood, without requiring a fundamentally new replicate-aware inference framework. The paper should therefore clarify whether the proposed formulation offers a substantive methodological advantage over such straightforward extensions.
- The experimental comparison among amortized methods is not sufficiently convincing. The proposed model is trained directly on thousands of tasks generated from the same GP-based inhomogeneous Poisson process family used for evaluation, whereas FIM-PP, the only amortized baseline, is evaluated using its released pretrained checkpoint without any task-specific adaptation. Since FIM-PP is designed to infer history-dependent conditional intensities rather than the intensity functions of inhomogeneous Poisson processes considered here, the substantial performance gap may primarily reflect a mismatch in task formulation and training distribution rather than a clear methodological advantage of the proposed framework. A more informative and fair comparison would either fine-tune FIM-PP on the same training tasks or include an amortized intensity-inference baseline trained on the same data-generating distribution under a comparable computational budget.
- More broadly, if the goal is to evaluate uncertainty-aware intensity-function estimation, the baseline set should be substantially strengthened. As the authors note, several methods have been proposed that offer faster alternatives to LGCP-based inference (e.g., INLA), and at least some of them should be included for comparison. In addition, PSTH seems too weak a baseline for estimating the smooth intensity functions considered in the experiments, since it is inherently piecewise constant. If a non-Bayesian baseline is to be included, it would be more informative to compare not only with the classical KDE estimator but also with more recent kernel-based intensity estimators such as (Kim et al., ICML, 2025).
Questions for authors
See Critical Weaknesses.
9 comments
To assess the effectiveness of our training scheme, we additionally compare our model (trained with the conditional objective) to the same encoder-decoder architecture trained with a standard VAE ELBO. The results of this ablation study are reported in the table below. They show that our conditional objective leads to more accurate estimates and narrower intervals as the number of realizations increases, while maintaining relatively stable coverage, compared to the standard ELBO. These advantages become more pronounced when the number of replicates at test time is larger than the number used during training.
Synthetic results for the objective ablation (mean ± standard deviation across four seeds).
| RMSE Ours ↓ | RMSE Standard ↓ | C95 Ours (%) | C95 Standard (%) | IW95 Ours | IW95 Standard | |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | ||||||
| 4 | ||||||
| 8 | ||||||
| 16 | ||||||
| 32 | ||||||
| 64 |
Finally we underline that one of the methods cited in the related work, Neural Diffusion Intensity Model (NDIM; Du et al., 2026) could not be compared to due to the lack of an available implementation at the time of this rebuttal. We also recall that NDIM places a Markov diffusion prior on the latent intensity through a neural SDE, whereas our method does not impose this structural assumption.
2. Fine-tuning FIM-PP
Firstly, we would like to clarify that FIM-PP (Berghaus et al., 2026) is not restricted to history-dependent processes. In fact, its pre-training data includes realizations of homogeneous Poisson processes, and its data-generation scheme allows for the generation of inhomogeneous Poisson processes. Moreover, their paper also presents inference results for history-independent processes. Nevertheless, we agree with your comment that fine-tuning this model on our data provides a fairer and more informative comparison to our method.
We fine-tuned the released FIM-PP checkpoint on the same training tasks used for our model. The updated results are reported in the “Synthetic and Divvy results” table. We observed that fine-tuning substantially improved FIM-PP, nonetheless our model retains lower intensity RMSE on the synthetic data and higher held-out log-likelihood on the Divvy data.
3. Additional Baselines
We addressed your comment on the lack of strong baselines by adding the approximate Bayesian method LGCP-INLA and the kernel density-based estimator IE. However we would like to clarify that our original set of baselines already included a fast inference method for the LGCP (LGCP-VI). The latter uses sparse variational inference with inducing points, which is already a faster alternative to full GP inference.
Nonetheless the updated experimental results, reported in the “Synthetic and Divvy results” table, show that LGCP-INLA is a more accurate baseline than LGCP-VI, at the cost of longer inference time. Moreover compared with LGCP–INLA, our model achieves comparable intensity recovery and credible interval width, but coverage closer to the nominal level 95%, on the synthetic data. On the Divvy data, it achieves slightly higher Divvy held-out log-likelihood, but has substantially shorter inference time. Compared with IE, our model achieves slightly lower synthetic intensity RMSE and higher Divvy held-out log-likelihood. We retain PSTH as a simple histogram reference, alongside KDE and IE.
Therefore, overall our method achieves favourable performance compared to all tested baselines. We thank the reviewer for their suggestions of adding LGCP-INLA and IE which were shown to be the strongest baselines in our comparison.
In the revised manuscript, we will include the additional baseline comparisons and the objective ablation study.
References
Fabian E. Bachl, Finn Lindgren, David L. Borchers, and Janine B. Illian. inlabru: an R package for Bayesian spatial modelling from ecological survey data. Methods in Ecology and Evolution, 10:760–766, 2019.
David Berghaus, Patrick Seifner, Kostadin Cvejoski, César Ali Ojeda Marin, and Ramses Sanchez. In-Context Learning of Temporal Point Processes with Foundation Inference Models. In International Conference on Learning Representations, pp. 29610–29641, 2026.
Xinlong Du, Harsha Honnappa, and Vinayak Rao. Neural Diffusion Intensity Models for Point Process Data. In Proceedings of the 42nd Conference on Uncertainty in Artificial Intelligence, PMLR 337, pp. 1448–1473, 2026.
Hideaki Kim, Tomoharu Iwata, and Akinori Fujino. IE: Kernel Method-based Kernel Intensity Estimators for Inhomogeneous Poisson Processes. Proceedings of the 42nd International Conference on Machine Learning, PMLR 267, pp. 30099–30112, 2025.
Gabriel Loaiza-Ganem, Sean M. Perkins, Karen E. Schroeder, Mark M. Churchland, and John P. Cunningham. Deep Random Splines for Point Process Intensity Estimation of Neural Population Data. In Advances in Neural Information Processing Systems, volume 32, 2019.
Håvard Rue, Sara Martino, and Nicolas Chopin. Approximate Bayesian inference for latent Gaussian models by using integrated nested Laplace approximations. Journal of the Royal Statistical Society: Series B, 71(2):319–392, 2009.
Dear Reviewer nh35,
We thank the reviewer for the thoughtful comments, which helped us clarify our contributions relative to existing methods and strengthen the baseline comparisons.
We have carefully considered your comments and address your concerns below.
1. Methodological Novelty
We agree that under our assumption of observing K independent realisations from a Poisson process, one can combine all the events into a single sequence and divide the estimated intensity, e.g., using some of the cited methods, by K to obtain the desired intensity. However, our focus is not only on (fast) inference in this setting, but rather on designing a trainable neural-network-based model that, as more realizations become available, refines its estimates of a shared latent intensity and provides calibrated uncertainty quantification, without requiring per-task optimization or a computationally costly hierarchical (fully) Bayesian model. In other words, rather than proposing a fundamentally new inference setting, our main contribution is to introduce an amortized inference framework that processes multiple realizations from a shared intensity and is trained via a context-target objective.
Related to our response to a comment by Reviewer 9Uw9, an alternative approach could entail designing an encoder taking as input the aggregated sequence of events and K. However, the results reported in the encoder comparison table in our response to Reviewer 9Uw9 show that such an encoder tends to underperform in terms of RMSE relative to ours, when the number of test replicates is larger than the number used during training.
Nonetheless we acknowledge that the set of baselines in our original manuscript was not sufficient, as also suggested by Reviewer F4ea. Therefore we have added 3 baselines: DRS-VAE (Loaiza-Ganem et al., 2019), LGCP-INLA (Rue et al., 2009; Bachl et al., 2019), and K$^2$IE (Kim et al., 2025). We leave the discussion on the latter two to the response to your 3rd comment below and here focus on the Deep Random Splines Variational Autoencoder (DRS-VAE). We adapted the latter to the replicated sequences setting by pooling the events into a single sequence. We trained the released architecture with the default model configuration and compared it to our method. We note that both methods use the same training, validation and test data, with checkpoints selected by validation held-out likelihood. We follow the synthetic and Divvy settings in Section 4 of the paper, using Ktrain=Ktest=4 for synthetic data. We report our results in the table below.
Synthetic and Divvy results (mean ± standard deviation across four seeds).
We observe that our model achieves better performance than the DRS-VAE: on the synthetic data it has lower RMSE and coverage closer to the nominal level 95%, and has higher held-out likelihood on the Divvy dataset. As suggested by Reviewer F4ea, we added 2 prediction performance metrics to our comparison of methods on the Divvy dataset: the next-event RMSE (NE-RMSE) and CRPS. These results are in the next-event prediction table in our response to Reviewer F4ea and confirm that our method performs favourably relative to all baselines.
Besides, we further highlight the differences between our method and DRS-VAE, in terms of encoder, decoder, and training objective. DRS-VAE has a recurrent encoder and a spline decoder while our model only uses fully-connected layers. Moreover, while DRS-VAE uses a standard Gaussian prior VAE ELBO, our conditional objective uses a penalization in term of the divergence between the distribution inferred from a context subset and that inferred from the full set of realizations (context and target).