Recursive Monte Carlo filters, also called particle filters, are a powerful tool to perform computations in general state space models. We discuss and compare the accept–reject version with the more common sampling importance resampling version of the algorithm. In particular, we show how auxiliary variable methods and stratification can be used in the accept–reject version, and we compare different resampling techniques. In a second part, we show laws of large numbers and a central limit theorem for these Monte Carlo filters by simple induction arguments that need only weak conditions. We also show that, under stronger conditions, the required sample size is independent of the length of the observed series.
Publié le : 2005-10-14
Classification:
State space models,
hidden Markov models,
filtering and smoothing,
particle filters,
auxiliary variables,
sampling importance resampling,
central limit theorem,
62M09,
60G35,
60J22,
65C05
@article{1132936554,
author = {K\"unsch, Hans R.},
title = {Recursive Monte Carlo filters: Algorithms and theoretical analysis},
journal = {Ann. Statist.},
volume = {33},
number = {1},
year = {2005},
pages = { 1983-2021},
language = {en},
url = {http://dml.mathdoc.fr/item/1132936554}
}
Künsch, Hans R. Recursive Monte Carlo filters: Algorithms and theoretical analysis. Ann. Statist., Tome 33 (2005) no. 1, pp. 1983-2021. http://gdmltest.u-ga.fr/item/1132936554/