Hostname: page-component-8448b6f56d-wq2xx Total loading time: 0 Render date: 2024-04-25T03:42:37.052Z Has data issue: false hasContentIssue false

Uniform approximations of discrete-time filters

Published online by Cambridge University Press:  01 July 2016

Kari Heine*
Affiliation:
Tampere University of Technology
Dan Crisan*
Affiliation:
Imperial College London
*
Email address: kari.heine@wire.fi
∗∗ Postal address: Department of Mathematics, Huxley Building, Imperial College, 180 Queens Gate, London SW7 2BZ, UK.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Throughout recent years, various sequential Monte Carlo methods, i.e. particle filters, have been widely applied to various applications involving the evaluation of the generally intractable stochastic discrete-time filter. Although convergence results exist for finite-time intervals, a stronger form of convergence, namely, uniform convergence, is required for bounding the error on an infinite-time interval. In this paper we prove easily verifiable conditions for the filter applications that are sufficient for the uniform convergence of certain particle filters. Essentially, the conditions require the observations to be accurate enough. No mixing or ergodicity conditions are imposed on the signal process.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2008 

References

Atar, R. and Zeitouni, O. (1997). Exponential stability for nonlinear filtering. Ann. Inst. H. Poincaré Prob. Statist. 33, 697725.Google Scholar
Crisan, D. (2001). Particle filters - a theoretical perspective. In Sequential Monte Carlo Methods in Practice, eds Doucet, A. et al., Springer, New York, pp. 1741.Google Scholar
Crisan, D. and Heine, K. (2008). Stability of the discrete time filter in terms of the tails of noise distributions. J. London Math. Soc. 78, 441458.Google Scholar
Del Moral, P. (1998). A uniform convergence theorem for the numerical solving of the nonlinear filtering problem. J. Appl. Prob. 4, 873884.Google Scholar
Moral, Del, and, P. Guionnet, A. (2001). On the stability of interacting processes with applications to filtering and genetic algorithms. Ann. Inst. H. Poincaré Prob. Statist. 37, 155194.Google Scholar
Dobrushin, R. L. (1956). Central limit theorem for non-stationary Markov chains. I. Theory Prob. Appl. 1, 7289.Google Scholar
Heine, K. (2007). On the stability of the discrete time filter and the uniform convergence of its approximations. , Tampere University of Technology.Google Scholar
Kitagawa, G. (1996). Monte Carlo filter and smoother for non-Gaussian nonlinear state space models. J. Comput. Graph. Statist. 5, 125.Google Scholar
Kontoyiannis, I. and Meyn, S. P. (2005). Large deviations asymptotics and the spectral theory of multiplicatively regular Markov processes. Electron. J. Prob. 10, 61123.Google Scholar
Künsch, H. (2005). Recursive Monte Carlo filters: algortihms and theoretical analysis. Ann. Statist. 33, 19831983.Google Scholar
LeGland, F. and Oudjane, N. (2003). A robustification approach to stability and to uniform particle approximation of nonlinear filters: the example of pseudo-mixing signals. Stoch. Process. Appl. 106, 279316.Google Scholar
LeGland, F. and Oudjane, N. (2004). Stability and uniform approximation of nonlinear filters using the Hilbert metric, and applications to particle filters. Ann. Appl. Prob. 14, 144187.Google Scholar
Oudjane, N. and Rubenthaler, S. (2005). Stability and uniform particle approximation of nonlinear filters in case of non ergodic signals. Stoch. Anal. Appl. 23, 421448.Google Scholar
Papavasiliou, A. (2005). A uniformly convergent adaptive particle filter. J. Appl. Prob. 4, 10531068.Google Scholar
Wu, L. (2000). Some notes on large deviations of Markov processes. Acta Math. Sin. (Engl. Ser.), 16, 369394.Google Scholar