The Alive Particle Filter and Its Use in Particle Markov Chain Monte Carlo

Pierre Del Moral, Ajay Jasra, Anthony Lee, Christopher Yau, Xiaole Zhang

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


In the following article, we investigate a particle filter for approximating Feynman–Kac models with indicator potentials and we use this algorithm within Markov chain Monte Carlo (MCMC) to learn static parameters of the model. Examples of such models include approximate Bayesian computation (ABC) posteriors associated with hidden Markov models (HMMs) or rare-event problems. Such models require the use of advanced particle filter or MCMC algorithms to perform estimation. One of the drawbacks of existing particle filters is that they may “collapse,” in that the algorithm may terminate early, due to the indicator potentials. In this article, using a newly developed special case of the locally adaptive particle filter, we use an algorithm that can deal with this latter problem, while introducing a random cost per-time step. In particular, we show how this algorithm can be used within MCMC, using particle MCMC. It is established that, when not taking into account computational time, when the new MCMC algorithm is applied to a simplified model it has a lower asymptotic variance in comparison to a standard particle MCMC algorithm. Numerical examples are presented for ABC approximations of HMMs.
Original languageEnglish (US)
JournalStochastic Analysis and Applications
Issue number6
StatePublished - Jan 1 2015
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2019-11-20


Dive into the research topics of 'The Alive Particle Filter and Its Use in Particle Markov Chain Monte Carlo'. Together they form a unique fingerprint.

Cite this