Limit theorems for sequential MCMC methods

Journal article

Both sequential Monte Carlo (SMC) methods (a.k.a. ‘particle filters’) and sequential Markov chain Monte Carlo (sequential MCMC) methods constitute classes of algorithms which can be used to approximate expectations with respect to (a sequence of) probability distributions and their normalising constants. While SMC methods sample particles conditionally independently at each time step, sequential MCMC methods sample particles according to a Markov chain Monte Carlo (MCMC) kernel. Introduced over twenty years ago in [6], sequential MCMC methods have attracted renewed interest recently as they empirically outperform SMC methods in some applications. We establish an -inequality (which implies 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 also provide conditions under which sequential MCMC methods can indeed outperform standard SMC methods in terms of asymptotic variance of the corresponding Monte Carlo estimators.

Authors: Finke, A; Doucet, A; Johansen, AM

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Cambridge University Press
• Journal: Advances in Applied Probability
• Volume: 52
• Issue: 2
• Pages: 377-403
• Publication date: 2020-07-15
• Acceptance date: 2019-12-16
• DOI: 10.1017/apr.2020.9
• EISSN: 1475-6064
• ISSN: 0001-8678
• Language: English
• Keywords: FFR; time-uniform convergence; sequential Monte Carlo methods; particle filters; multivariate central limit theorem; almost sure convergence; Markov chain Monte Carlo methods