analiza aiqbench
This paper applies neural amortized variational inference to Bayesian estimation of latent point-process intensities, so one trained network can infer a distribution over a shared intensity from a variable number of event sequences in a single forward pass. The main claim is practical: faster inference than a Log-Gaussian Cox Process baseline with comparable or better held-out likelihood on bicycle-sharing data. Readers should weigh the evidence as a two-dataset study, with the synthetic results showing how credible-interval width and coverage behave as realizations are added.
Amortized Variational Inference of Latent Intensities from Replicated Point Patterns
arXiv:2610.16669v1 Announce Type: cross Abstract: Bayesian inference for latent point process intensities often relies on per-dataset sampling or optimization, making repeated inference computationally expensive. We propose a neural-network-based amortized variational framework that learns a reusable inference rule mapping a variable number of replicated point patterns to a distribution over their shared latent intensity. Trained from event times using the point process likelihood, the model learns an amortized inference rule without ground-truth intensity supervision. At test time, it performs inference of the latent distribution in a forward pass. On synthetic data, additional realizations improve intensity recovery and yield narrower credible intervals with broadly stable coverage. Our method is tested on bicycle-sharing data and achieves the highest mean held-out log likelihood among the evaluated methods while requiring substantially less inference time than the Log-Gaussian Cox Process baseline.
Abstract:Bayesian inference for latent point process intensities often relies on per-dataset sampling or optimization, making repeated inference computationally expensive. We propose a neural-network-based amortized variational framework that learns a reusable inference rule mapping a variable number of replicated point patterns to a distribution over their shared latent intensity. Trained from event times using the point process likelihood, the model learns an amortized inference rule without ground-truth intensity supervision. At test time, it performs inference of the latent distribution in a forward pass. On synthetic data, additional realizations improve intensity recovery and yield narrower credible intervals with broadly stable coverage. Our method is tested on bicycle-sharing data and achieves the highest mean held-out log likelihood among the evaluated methods while requiring substantially less inference time than the Log-Gaussian Cox Process baseline.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2610.16669 [stat.ML]
(or arXiv:2610.16669v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.16669 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 227 cuvinte
Subiecte conexe

Serving 64Mi-Token Contexts on One AMD Instinct™ MI355X Node
AMD · 24 aug. 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · 8 oct. 2026
Amortized Structured Stochastic Variational Inference for Gaussian Process Latent Variable Models
arXiv · 5 oct. 2026
DI Series: Serving Kimi-K3 MXFP4 Wide-EP Disaggregated on AMD Instinct MI300X and MI325X
AMD · 8 oct. 2026