
























Abstract:State-space models (SSMs) are powerful probabilistic tools for modeling time-varying systems with latent dynamics. Inference in SSMs involves the estimation of latent states and parameters. In this work, we focus on parameter inference, which for SSMs is in general a very challenging problem due to the intractability of the likelihood. Recently, neural estimation methods, such as sequential neural likelihood (SNL), have shown promising results in Bayesian inference problems. In this paper, we show that SNL, when applied to the SSM setting, suffers important limitations, such as requiring a large amount of simulated samples to achieve a moderate performance, scaling poorly with sequence length, while not being amortized. We then introduce a novel inference algorithm called truncated-SNL (T-SNL), which addresses the limitations of SNL. Our algorithm is more accurate, more stable and robust during training, more scalable to longer temporal sequences, and can be amortized when new observations become available. Our experiments show that T-SNL is sample-efficient, robust, and flexible algorithm which outperforms other approaches.
| Subjects: | Computation (stat.CO); Machine Learning (cs.LG); Machine Learning (stat.ML) |
| Cite as: | arXiv:2605.21805 [stat.CO] |
| (or arXiv:2605.21805v1 [stat.CO] for this version) | |
| https://doi.org/10.48550/arXiv.2605.21805 arXiv-issued DOI via DataCite (pending registration) |
From: Kostas Tsampourakis [view email]
[v1]
Wed, 20 May 2026 23:01:21 UTC (787 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。