Particle-based adaptive-lag online marginal smoothing in general state-space models
arXiv:1812.10939 · doi:10.1109/TSP.2019.2941066
Abstract
We present a novel algorithm, an adaptive-lag smoother, approximating efficiently, in an online fashion, sequences of expectations under the marginal smoothing distributions in general state-space models. The algorithm evolves recursively a bank of estimators, one for each marginal, in resemblance with the so-called particle-based, rapid incremental smoother (PaRIS). Each estimator is propagated until a stopping criterion, measuring the fluctuations of the estimates, is met. The presented algorithm is furnished with theoretical results describing its asymptotic limit and memory usage.
arXiv comment12 pages, 8 figures
References in corpus (6)
- Sequential Monte Carlo smoothing with application to parameter estimation in non-linear state space models
- Sequential Monte Carlo smoothing for general state space hidden Markov models
- Uniform Time Average Consistency of Monte Carlo Particle Filters
- Path storage in the particle filter
- Long-term stability of sequential Monte Carlo methods under verifiable conditions
- Particle Smoothing for Hidden Diffusion Processes: Adaptive Path Integral Smoother