Open Access
Translator Disclaimer
December 2004 Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
Nicolas Chopin
Ann. Statist. 32(6): 2385-2411 (December 2004). DOI: 10.1214/009053604000000698

Abstract

The term “sequential Monte Carlo methods” or, equivalently, “particle filters,” refers to a general class of iterative algorithms that performs Monte Carlo approximations of a given sequence of distributions of interest (πt). We establish in this paper a central limit theorem for the Monte Carlo estimates produced by these computational methods. This result holds under minimal assumptions on the distributions πt, and applies in a general framework which encompasses most of the sequential Monte Carlo methods that have been considered in the literature, including the resample-move algorithm of Gilks and Berzuini [J. R. Stat. Soc. Ser. B Stat. Methodol. 63 (2001) 127–146] and the residual resampling scheme. The corresponding asymptotic variances provide a convenient measurement of the precision of a given particle filter. We study, in particular, in some typical examples of Bayesian applications, whether and at which rate these asymptotic variances diverge in time, in order to assess the long term reliability of the considered algorithm.

Citation

Download Citation

Nicolas Chopin. "Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference." Ann. Statist. 32 (6) 2385 - 2411, December 2004. https://doi.org/10.1214/009053604000000698

Information

Published: December 2004
First available in Project Euclid: 7 February 2005

zbMATH: 1079.65006
MathSciNet: MR2153989
Digital Object Identifier: 10.1214/009053604000000698

Subjects:
Primary: 60F05 , 62F15 , 65C05
Secondary: 62L10 , 82C80

Keywords: Markov chain Monte Carlo , particle filter , recursive Monte Carlo filter , resample-move algorithms , residual resampling , state-space model

Rights: Copyright © 2004 Institute of Mathematical Statistics

JOURNAL ARTICLE
27 PAGES


SHARE
Vol.32 • No. 6 • December 2004
Back to Top