Limit theorems for sequential MCMC methods

Abstract

Sequential Monte Carlo (SMC) methods, also known as particle filters, constitute a class of algorithms used to approximate expectations with respect to a sequence of probability distributions as well as the normalising constants of those distributions. Sequential MCMC methods are an alternative class of techniques addressing similar problems in which particles are sampled according to an MCMC kernel rather than conditionally independently at each time step. These methods were introduced over twenty years ago by Berzuini et al. (1997). Recently, there has been a renewed interest in such algorithms as they demonstrate an empirical performance superior to that of SMC methods in some applications. We establish a strong law of large numbers and a central limit theorem for sequential MCMC methods and provide conditions under which errors can be controlled uniformly in time. In the context of state-space models, we provide conditions under which sequential MCMC methods can indeed outperform standard SMC methods in terms of asymptotic variance of the corresponding Monte Carlo estimators.

References in corpus (9)

• The pseudo-marginal approach for efficient Monte Carlo computations
• Recursive Monte Carlo filters: Algorithms and theoretical analysis
• Renewal theory and computable convergence rates for geometrically ergodic Markov chains
• Langevin and Hamiltonian based Sequential MCMC for Efficient Bayesian Filtering in High-dimensional Spaces
• Lookahead Strategies for Sequential Monte Carlo
• Sequentially interacting Markov chain Monte Carlo methods
• On nonlinear Markov chain Monte Carlo
• Interacting Markov chain Monte Carlo methods for solving nonlinear measure-valued equations
• On embedded hidden Markov models and particle Markov chain Monte Carlo methods