Article contents
On the asymptotic variance in the central limit theorem for particle filters
Published online by Cambridge University Press: 03 July 2012
Abstract
Particle filter algorithms approximate a sequence of distributions by a sequence of empirical measures generated by a population of simulated particles. In the context of Hidden Markov Models (HMM), they provide approximations of the distribution of optimal filters associated to these models. For a given set of observations, the behaviour of particle filters, as the number of particles tends to infinity, is asymptotically Gaussian, and the asymptotic variance in the central limit theorem depends on the set of observations. In this paper we establish, under general assumptions on the hidden Markov model, the tightness of the sequence of asymptotic variances when considered as functions of the random observations as the number of observations tends to infinity. We discuss our assumptions on examples and provide numerical simulations.
Keywords
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, SMAI, 2012
References
Références
- 4
- Cited by