Efficient Online Variational Estimation via Monte Carlo Sampling
Mathis Chagneux, Mathias Müller, Pierre Gloaguen, Sylvain Le Corff, Jimmy Olsson
Abstract
This article addresses online variational estimation in parametric state-space models. We propose a new procedure for efficiently computing the evidence lower bound and its gradient in a streaming-data setting, where observations arrive sequentially. The algorithm allows for the simultaneous training of the model parameters and the distribution of the latent states given the observations. It is based on i.i.d. Monte Carlo sampling, coupled with a well-chosen deep architecture, enabling both computational efficiency and flexibility. The performance of the method is illustrated on both synthetic data and real-world air-quality data. The proposed approach is theoretically motivated by the existence of an asymptotic contrast function and the ergodicity of the underlying Markov chain, and applies more generally to the computation of additive expectations under posterior distributions in state-space models. 1 au:v is a short-hand notation for (au, . . . , av).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on2
Related papers
- Online Variational Sequential Monte CarloAlessandro Mastrototaro, Jimmy OlssonICML 2024 · 5 citations
- Efficient Learning of Deep State Space Models via Importance SmoothingJohn-Joseph Brady, Nikolas Nüsken, Yunpeng LiICML 2026
- Langevin Autoencoders for Learning Deep Latent Variable ModelsShohei Taniguchi, Yusuke Iwasawa, Wataru Kumagai, Yutaka MatsuoNeurIPS 2022 · 2 citations
- Deep Bayesian Filter for Bayes-Faithful Data AssimilationYuta Tarumi, Keisuke Fukuda, Shin-ichi MaedaICML 2025
- VarGrad: A Low-Variance Gradient Estimator for Variational InferenceLorenz Richter, Ayman Boustati, Nikolas Nüsken, Francisco J. R. Ruiz et al.NeurIPS 2020 · 90 citations
