Online Rolling Controlled Sequential Monte Carlo
Liwen Xue, Axel Finke, Adam M. Johansen

TL;DR
This paper presents ORCSMC, a real-time inference method for hidden Markov models that extends controlled sequential Monte Carlo to online settings, improving accuracy and robustness.
Contribution
It introduces a novel online rolling CSMC algorithm that uses dual particle systems for adaptive filtering with bounded computational cost.
Findings
Improved estimation accuracy over standard particle filters.
Demonstrated robustness in high-dimensional models.
Effective in linear-Gaussian, stochastic volatility, and neuroscience models.
Abstract
We introduce methodology for real-time inference in general-state-space hidden Markov models. Specifically, we extend recent advances in controlled sequential Monte Carlo (CSMC) methods-originally proposed for offline smoothing-to the online setting via a rolling window mechanism. Our novel online rolling controlled sequential Monte Carlo (ORCSMC) algorithm employs two particle systems to simultaneously estimate twisting functions and perform filtering, ensuring real-time adaptivity to new observations while maintaining bounded computational cost. Numerical results on linear-Gaussian, stochastic volatility, and neuroscience models demonstrate improved estimation accuracy and robustness in higher dimensions, compared to standard particle filtering approaches. The method offers a statistically efficient and practical solution for sequential and real-time inference in complex latent…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGaussian Processes and Bayesian Inference · Target Tracking and Data Fusion in Sensor Networks · Generative Adversarial Networks and Image Synthesis
