Convergence of sequential Monte Carlo methods

  • Crisan D
  • Doucet A
N/ACitations
Citations of this article
53Readers
Mendeley users who have this article in their library.

Abstract

Bayesian estimation problems where the posterior distribution evolves over time through the accumulation of data arise in many applications in statistics and related fields. Recently, a large number of algorithms and applications based on sequential Monte Carlo methods (also known as particle filtering methods) have appeared in the literature to solve this class of problems; see (Doucet, de Freitas & Gordon, 2001) for a survey. However, few of these methods have been proved to converge rigorously. The purpose of this paper is to address this issue. We present a general sequential Monte Carlo (SMC) method which includes most of the important features present in current SMC methods. This method generalizes and encompasses many recent algorithms. Under mild regularity conditions, we obtain rigorous convergence results for this general SMC method and therefore give theoretical backing for the validity of all the algorithms that can be obtained as particular cases of it.

Cite

CITATION STYLE

APA

Crisan, D., & Doucet, A. (2000). Convergence of sequential Monte Carlo methods. Signal Process. Group, Dept. Eng., Univ. Cambridge, Cambridge, UK, Tech. Rep. CUED/F-INFENG/TR381, 1–41. Retrieved from papers3://publication/uuid/40658115-0479-4649-9473-578A65B0EED6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free