Conditional particle filters with bridge backward sampling
Santeri Karppinen, Sumeetpal S. Singh, Matti Vihola

TL;DR
This paper introduces a novel bridge backward sampling method for conditional particle filters, improving sampling efficiency in models with weakly informative observations and slow dynamics by using auxiliary bridging steps and specialized resampling strategies.
Contribution
It proposes a generalized CPF with bridge backward sampling and new resampling strategies, addressing degeneracy and inefficiency issues in challenging regimes.
Findings
Enhanced sampling efficiency in weakly informative regimes.
Effective resampling strategies reduce variance and degeneracy.
Practical tuning methods improve applicability.
Abstract
Conditional particle filters (CPFs) with backward/ancestor sampling are powerful methods for sampling from the posterior distribution of the latent states of a dynamic model such as a hidden Markov model. However, the performance of these methods deteriorates with models involving weakly informative observations and/or slowly mixing dynamics. Both of these complications arise when sampling finely time-discretised continuous-time path integral models, but can occur with hidden Markov models too. Multinomial resampling, which is commonly employed with CPFs, resamples excessively for weakly informative observations and thereby introduces extra variance. Furthermore, slowly mixing dynamics render the backward/ancestor sampling steps ineffective, leading to degeneracy issues. We detail two conditional resampling strategies suitable for the weakly informative regime: the so-called `killing'…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks · Underwater Acoustics Research
