kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Recursive Learning of Asymptotic Variational Objectives
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Probability, Mathematical Physics and Statistics.ORCID iD: 0000-0001-9380-1197
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Probability, Mathematical Physics and Statistics.ORCID iD: 0009-0008-3893-8666
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Probability, Mathematical Physics and Statistics.ORCID iD: 0000-0003-0772-846X
2025 (English)In: INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS / [ed] Li, Y Mandt, S Agrawal, S Khan, E, JMLR , 2025, Vol. 258Conference paper, Published paper (Refereed)
Abstract [en]

General state-space models (SSMs) are widely used in statistical machine learning and are among the most classical generative models for sequential time-series data. SSMs, comprising latent Markovian states, can be subjected to variational inference (VI), but standard VI methods like the importance-weighted autoencoder (IWAE) lack functionality for streaming data. To enable online VI in SSMs when the observations are received in real time, we propose maximising an IWAE-type variational lower bound on the asymptotic contrast function, rather than the standard IWAE ELBO, using stochastic approximation. Unlike the recursive maximum likelihood method, which directly maximises the asymptotic contrast, our approach, called online sequential IWAE (OS-IWAE), allows for online learning of both model parameters and a Markovian recognition model for inferring latent states. By approximating filter state posteriors and their derivatives using sequential Monte Carlo (SMC) methods, we create a particle-based framework for online VI in SSMs. This approach is more theoretically well-founded than recently proposed online variational SMC methods. We provide rigorous theoretical results on the learning objective and a numerical study demonstrating the method's efficiency in learning model parameters and particle proposal kernels.

Place, publisher, year, edition, pages
JMLR , 2025. Vol. 258
Series
Proceedings of Machine Learning Research, ISSN 2640-3498
National Category
Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:kth:diva-378637ISI: 001593416700160OAI: oai:DiVA.org:kth-378637DiVA, id: diva2:2049246
Conference
28th International Conference on Artificial Intelligence and Statistics-AISTATS-Annual, MAY 03-05, 2025, THAILAND
Note

QC 20260327

Available from: 2026-03-27 Created: 2026-03-27 Last updated: 2026-03-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Fulltext

Authority records

Mastrototaro, AlessandroMüller, MathiasOlsson, Jimmy

Search in DiVA

By author/editor
Mastrototaro, AlessandroMüller, MathiasOlsson, Jimmy
By organisation
Probability, Mathematical Physics and Statistics
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 11 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf