Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-26T16:11:55.564Z Has data issue: false hasContentIssue false
  • English
  • Français

Using systematic sampling selection for Monte Carlo solutions of Feynman-Kac equations

Part of: Markov processes Probabilistic methods, simulation and stochastic differential equations Stochastic processes

Published online by Cambridge University Press:  01 July 2016

Ivan Gentil  and
Bruno Rémillard
Ivan Gentil*
Affiliation:
Université Paris-Dauphine
Bruno Rémillard*
Affiliation:
HEC Montréal
*
∗ Postal address: CEREMADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, F-75775 Paris cedex 16, France. Email address: gentil@ceremade.dauphine.fr
∗∗ Postal address: Service de l'enseignement des méthodes quantitatives de gestion, HEC Montréal, 3000 chemin de la côte-Sainte-Catherine, Montréal, Canada H3T 2A7. Email address: bruno.remillard@hec.ca
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.

While the convergence properties of many sampling selection methods can be proven, there is one particular sampling selection method introduced in Baker (1987), closely related to ‘systematic sampling’ in statistics, that has been exclusively treated on an empirical basis. The main motivation of the paper is to start to study formally its convergence properties, since in practice it is by far the fastest selection method available. We will show that convergence results for the systematic sampling selection method are related to properties of peculiar Markov chains.

Keywords

Feynman-Kac formulaesequential Monte Carlogenetic algorithmsystematic samplingMarkov chain

MSC classification

Primary: 65C35: Stochastic particle methods 60G35: Signal detection and filtering
Secondary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 40 , Issue 2 , June 2008 , pp. 454 - 472
Copyright
Copyright © Applied Probability Trust 2008 

References

Baker, J. E. (1985). Adaptive selection methods for genetic algorithms. In Proc. Internat. Conf. Genetic Algorithms App., Erlbaum, pp. 101–111.Google Scholar
Baker, J. E. (1987). Reducing bias and inefficiency in the selection algorithm. In Proc. Second Internat. Conf. Genetic Algorithms App., Erlbaum, pp. 14–21.Google Scholar
Brindle, A. (1980). Genetic algorithms for function optimization. , Department of Computer and Communication Sciences, University of Michigan.Google Scholar
Cappé, O., Douc, R. and Moulines, E. (2005). Comparison of resampling schemes for particle filtering. In 4th Internat. Symp. Image Signal Process. Anal. (Zagreb, Croatia).Google Scholar
Carpenter, J., Clifford, P. and Fearnhead, P. (1999). Building robust simulation-based filters for evolving data sets. Tech. Rep., Department of Tech. Rep. Google Scholar
Crisan, D. (2003). Exact rates of convergence for a branching particle approximation to the solution of the Zakai equation. Ann. Prob. 31, 693–718.CrossRefGoogle Scholar
Crisan, D. and Doucet, A. (2002). A survey of convergence results on particle filtering methods for practitioners. IEEE Trans. Signal Process. 50, 736–746.CrossRefGoogle Scholar
Crisan, D. and Lyons, T. (1999). A particle approximation of the solution of the Kushner–Stratonovitch equation. Prob. Theory Relat. Fields 115, 549–578.CrossRefGoogle Scholar
Crisan, D., Del Moral, P. and Lyons, T. (1999). Discrete filtering using branching and interacting particle systems. Markov Process. Relat. Fields 5, 293–318.Google Scholar
Crisan, D., Gaines, J. and Lyons, T. (1998). Convergence of a branching particle method to the solution of the Zakai equation. SIAM J. Appl. Math. 58, 1568–1590.CrossRefGoogle Scholar
Del Moral, P. (2004). Feynman–Kac Formulae. Genealogical and Interacting Particle Systems with Applications. Springer, New York.CrossRefGoogle Scholar
Del Moral, P. and Miclo, L. (2000). Branching and interacting particle systems approximations of Feynman–Kac formulae with applications to non-linear filtering. In Séminaire de Probabilités, XXXIV (Lecture Notes Math. 1729), Springer, Berlin, pp. 1–145.Google Scholar
Douc, R. and Moulines, E. (2008). Limit theorems for weighted samples with applications to sequential Monte Carlo methods. To appear in Ann. Statist.CrossRefGoogle Scholar
Durrett, R. (1996). Probability: Theory and Examples, 2nd edn. Duxbury Press, Belmont, CA.Google Scholar
Gentil, I., Rémillard, B. and Del Moral, P. (2005). Filtering of images for detecting multiple targets trajectories. In Statistical Modeling and Analysis for Complex Data Problem, Springer, New York, pp. 267–280.CrossRefGoogle Scholar
Kallianpur, G. and Striebel, C. (1968). Estimation of stochastic systems: arbitrary system process with additive white noise observation errors. Ann. Math. Statist. 39, 785–801.CrossRefGoogle Scholar
Künsch, H. R. (2005). Recursive Monte Carlo filters: algorithms and theoretical analysis. Ann. Statist. 33, 1983–1983.CrossRefGoogle Scholar
Liu, J. S. and Chen, R. (1998). Sequential Monte Carlo methods for dynamic systems. J. Amer. Statist. Assoc. 93, 1032–1044.CrossRefGoogle Scholar
Pitt, M. K. and Shephard, N. (1999). Filtering via simulation: auxiliary particle filters. J. Amer. Statist. Assoc. 94, 590–599.CrossRefGoogle Scholar
Sethuraman, S. and Varadhan, S. R. S. (2005). A martingale proof of Dobrushin's theorem for non-homogeneous Markov chains. Electron. J. Prob. 10, 1221–1235.CrossRefGoogle Scholar