The DOI matches its Crossref record.
Sequential Monte Carlo Samplers
Abstract
Summary: We propose a methodology to sample sequentially from a sequence of probability distributions that are defined on a common space, each distribution being known up to a normalizing constant. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time by using sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make parallel Markov chain Monte Carlo algorithms interact to perform global optimization and sequential Bayesian estimation and to compute ratios of normalizing constants. We illustrate these algorithms for various integration tasks arising in the context of Bayesian inference.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Similarly, by increasing the number of parallel samples, sequential Monte Carlo (SMC) methods asymptotically converge (Del Moral et al., 2006).”
From Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems (2024) · cites this paper as Del Moral et al., 2006
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 38
- Cappé, 2004, Population Monte Carlo, J. Computnl Graph. Statist., 13, 907, 10.1198/106186004X12803 · DOI
- Carpenter, 1999, An improved particle filter for non-linear problems, IEE Proc. Radar Sonar Navign, 146, 2, 10.1049/ip-rsn:19990255 · DOI
- Celeux, 2006, Iterated importance sampling in missing data problems, 10.1016/j.csda.2005.07.018 · DOI
- Chopin, 2002, A sequential particle filter for static models, Biometrika, 89, 539, 10.1093/biomet/89.3.539 · DOI
- Chopin, 2004, Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference, Ann. Statist., 32, 2385, 10.1214/009053604000000698 · DOI
- Chopin, 2004, Technical Report
- Crisan, 2000, Technical Report CUED/F-INFENG/TR381
- Del Moral, 2004, Feynman-Kac Formulae: Genealogical and Interacting Particle Systems with Applications, 10.1007/978-1-4684-9393-1 · DOI
- Del Moral, 2003, Séminaire de Probabilités, 415
- Doucet, 2006, Efficient block sampling strategies for sequential Monte Carlo, 10.1198/106186006X142744 · DOI
- Doucet, 2001, Sequential Monte Carlo Methods in Practice, 10.1007/978-1-4757-3437-9 · DOI
- Doucet, 2000, On sequential Monte Carlo sampling methods for Bayesian filtering, Statist. Comput., 10, 197, 10.1023/A:1008935410038 · DOI
- Fearnhead, 2003, On-line inference for hidden Markov models via particle filters, J. R. Statist. Soc. B, 65, 887, 10.1111/1467-9868.00421 · DOI
- Gelman, 1998, Simulating normalizing constants: from importance sampling to bridge sampling to path sampling, Statist. Sci., 13, 163, 10.1214/ss/1028905934 · DOI
- Gilks, 2001, Following a moving target—Monte Carlo inference for dynamic Bayesian models, J. R. Statist. Soc. B, 63, 127, 10.1111/1467-9868.00280 · DOI
- Givens, 1996, Local adaptive importance sampling for multivariate densities with strong non-linear relationships, J. Am. Statist. Ass., 91, 132, 10.1080/01621459.1996.10476670 · DOI
- Godsill, 2005, Proc. Wrkshp Statistics and Signal Processing
- Green, 1995, Reversible jump Markov chain Monte Carlo computation and Bayesian model determination, Biometrika, 82, 711, 10.1093/biomet/82.4.711 · DOI
- Green, 2003, Highly Structured Stochastic Systems, 179, 10.1093/oso/9780198510550.003.0017 · DOI
- Jarzynski, 1997, Nonequilibrium equality for free energy differences, Phys. Rev. Lett., 78, 2690, 10.1103/PhysRevLett.78.2690 · DOI
- Jasra, 2005, Technical Report
- Jasra, 2005, Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modelling, Statist. Sci., 20, 50, 10.1214/088342305000000016 · DOI
- Jerrum, 1996, Approximation Algorithms for NP Hard Problems, 482
- Johansen, 2005, Technical Report CUED/F-INFENG/543
- Kitagawa, 1996, Monte Carlo filter and smoother for non-gaussian, non-linear state space models, J. Computnl Graph. Statist., 5, 1, 10.1080/10618600.1996.10474692 · DOI
- Künsch, 2005, Recursive Monte Carlo filters: algorithms and theoretical analysis, Ann. Statist., 33, 1983, 10.1214/009053605000000426 · DOI
- Liang, 2002, Dynamically weighted importance sampling in Monte Carlo computation, J. Am. Statist. Ass., 97, 807, 10.1198/016214502388618618 · DOI
- Liu, 2001, Monte Carlo Strategies in Scientific Computing
- Liu, 1998, Sequential Monte Carlo for dynamic systems, J. Am. Statist. Ass., 93, 1032, 10.1080/01621459.1998.10473765 · DOI
- MacEachern, 1999, Sequential importance sampling for nonparametric Bayes: the next generation, Can. J. Statist., 27, 251, 10.2307/3315637 · DOI
- Maskell, 2004, Joint tracking of manoeuvring targets and classification of their manoeuvrability, J. Appl. Signal Process, 15, 2239
- Neal, 2001, Annealed importance sampling, Statist. Comput., 11, 125, 10.1023/A:1008923215028 · DOI
- Oh, 1993, Integration of multimodal functions by Monte Carlo importance sampling, J. Am. Statist. Ass., 88, 450, 10.1080/01621459.1993.10476295 · DOI
- Pitt, 1999, Filtering via simulation: auxiliary particle filter, J. Am. Statist. Ass., 94, 590, 10.1080/01621459.1999.10474153 · DOI
- Richardson, 1997, On Bayesian analysis of mixtures with an unknown number of components (with discussion), J. R. Statist. Soc. B, 59, 731, 10.1111/1467-9868.00095 · DOI
- Robert, 2004, Monte Carlo Statistical Methods, 10.1007/978-1-4757-4145-2 · DOI
- Rousset, 2005, Technical Report
- West, 1993, Approximating posterior distributions by mixtures, J. R. Statist. Soc. B, 55, 409, 10.1111/j.2517-6161.1993.tb01911.x · DOI
Cited by
Sorted by citations
Toni, T., Welch, D., Strelkowa, N., Ipsen, A., & Stumpf, M. P. H. (2009) · Journal of The Royal Society Interface · doi:10.1098/rsif.2008.0172 · Cited by 1,498
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
Adaptive approximate Bayesian computation
Beaumont, M. A., Cornuet, J.-M., Marin, J.-M., & Robert, C. P. (2009) · Biometrika · doi:10.1093/biomet/asp052 · Cited by 614
Simulation-based model selection for dynamical systems in systems and population biology
Toni, T., & Stumpf, M. P. H. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp619 · Cited by 260
Carneiro, G., Georgescu, B., Good, S., & Comaniciu, D. (2008) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2008.928917 · Cited by 205
A bayesian approach to targeted experiment design
Vanlier, J., Tiemann, C. A., Hilbers, P. A. J., & van Riel, N. A. W. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts092 · Cited by 98
Bayesian design of synthetic biological systems
Barnes, C. P., Silk, D., Sheng, X., & Stumpf, M. P. H. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1017972108 · Cited by 90
Models and Algorithms for Tracking of Maneuvering Objects Using Variable Rate Particle Filters
Godsill, S. J., Vermaak, J., Ng, W., & Li, J. F. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.894708 · Cited by 81
Post-GWAS: where next? More samples, more SNPs or more biology?
Marjoram, P., Zubair, A., & Nuzhdin, S. V. (2014) · Heredity · doi:10.1038/hdy.2013.52 · Cited by 74
Non-Reversible Parallel Tempering: A Scalable Highly Parallel MCMC Scheme
Syed, S., Bouchard-Côté, A., Deligiannidis, G., & Doucet, A. (2022) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12464 · Cited by 68
Self-citationOn sequential Monte Carlo, partial rejection control and approximate Bayesian computation
Peters, G. W., Fan, Y., & Sisson, S. A. (2012) · Statistics and Computing · doi:10.1007/s11222-012-9315-y · Cited by 69
Lopez, M. J., Matthews, G. J., & Baumer, B. S. (2018) · The Annals of Applied Statistics · doi:10.1214/18-aoas1165 · Cited by 52
Graph spectral analysis of protein interaction network evolution
Thorne, T., & Stumpf, M. P. H. (2012) · Journal of The Royal Society Interface · doi:10.1098/rsif.2012.0220 · Cited by 30
Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systems
Dalrymple, D. "., Skalse, J., Bengio, Y., Russell, S., Tegmark, M., Seshia, S., Omohundro, S., Szegedy, C., Goldhaber, B., Ammann, N., et al. (2024) · arXiv · doi:10.48550/arxiv.2405.06624 · Cited by 12
Metadata
- Authors
- Del Moral, P., Doucet, A., & Jasra, A.
- Affiliations
- Université Nice Sophia Antipolis , France
- University of British Columbia , Vancouver , Canada
- University of Cambridge , UK
- Venue
- Journal of the Royal Statistical Society Series B: Statistical Methodology
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-05-15
- Volume
- 68
- Issue
- 3
- Pages
- 411-436
- ISSN
- 1369-7412
- 1467-9868
- Cited by
- 1,239
- References
- 0
- Language
- en
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review