The DOI matches its Crossref record; 57 of the 60 references it cites were found in a registry or an index.
On sequential Monte Carlo, partial rejection control and approximate Bayesian computation
Abstract
We present a variant of the sequential Monte Carlo sampler by incorporating the partial rejection control mechanism of Liu (2001). We show that the resulting algorithm can be considered as a sequential Monte Carlo sampler with a modified mutation kernel. We prove that the new sampler can reduce the variance of the incremental importance weights when compared with standard sequential Monte Carlo samplers, and provide a central limit theorem. Finally, the sampler is adapted for application under the challenging approximate Bayesian computation modelling framework.
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
“We implemented their approach, but were not able to overcome the problem of particle depletion.”
From Integrating Crop Growth Models with Whole Genome Prediction through Approximate Bayesian Computation (2015) · cites this paper as [84]
Citations
Cites
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking
Arulampalam, M. S., Maskell, S., Gordon, N., & Clapp, T. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.978374 · Cited by 11,502 · cited 1×
“Variants of the methods sometimes appear under the names of particle filtering or interacting particle systems (e.g. Arulampalam et al. 2002; Andrieu et al. 2003; Del Moral 2004; Doucet et al. 2001), and their theoretical properties have been extensively studied (Crisan and Doucet 2002; Del Moral…”
MethodSequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366 · cited 7×
“The mechanism is similar to sequential importance sampling (resampling) (Liu 2001; Doucet et al. 2001), with one of the crucial differences being the framework under which the particles are allowed to move, resulting in differences in the calculation of the weights of the particles.”
BackgroundMethodInfluentialMarkov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041 · cited 1×
“ring under which conditions the mutation kernel M∗ n will be Feller, given the assumption of Crisan and Doucet (2002) that Mn is Feller. For definitions of the Feller property, see e.g. Feller (1971); Meyn and Tweedie (1993, Chapter 6). The Feller condition is sufficient to ensure that the resulting Markov chain generate…”
BackgroundHandbook of Markov Chain Monte Carlo
Brooks, S., Gelman, A., Jones, G., & Meng, X.-L. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b10905 · Cited by 2,993
Approximate Bayesian computation in population genetics
Beaumont, M. A., Zhang, W., & Balding, D. J. (2002) · Genetics · doi:10.1093/genetics/162.4.2025 · Cited by 2,932
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Filtering via Simulation: Auxiliary Particle Filters
Pitt, M. K., & Shephard, N. (1999) · Journal of the American Statistical Association · doi:10.1080/01621459.1999.10474153 · Cited by 2,438
Monte Carlo Filter and Smoother for Non-Gaussian Nonlinear State Space Models
Kitagawa, G. (1996) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1996.10474692 · Cited by 2,404 · cited 1×
“Kunsch 2005, Kitigawa 1996; Doucet et al. 2001).”
Research works printed but not linked: 1
- Yao, J.: Bayesian approach for prediction error in chain ladder claims reserving. In: 38th International ASTIN Colloquium, July (2008).
Cited by
The frontier of simulation-based inference
Cranmer, K., Brehmer, J., & Louppe, G. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1912789117 · Cited by 1,032
“5, and high-light the combination with Markov chain Monte Carlo (MCMC) (6) and sequential Monte Carlo (SMC) (7, 8).”
Fearnhead, P., & Prangle, D. (2012) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.01010.x · Cited by 567
“…as the rejection sampling, importance sampling and MCMC algorithms that we have mentioned, there has been work on using sequential Monte Carlo methods (Beaumont et al., 2009; Sisson et al., 2007; Peters et al., 2010) and adaptive methods (Bortot et al., 2007; Del Moral et al., 2012) among others.”
MethodA Comparative Review of Dimension Reduction Methods in Approximate Bayesian Computation
Blum, M. G. B., Nunes, M. A., Prangle, D., & Sisson, S. A. (2013) · Statistical Science · doi:10.1214/12-sts406 · Cited by 353
“These algorithms include Markov chain Monte Carlo (Marjoram et al. 2003; Bortot et al. 2007) and sequential Monte Carlo techniques (Sisson et al. 2007; Toni et al. 2009; Beaumont et al. 2009; Drovandi and Pettitt 2011; Peters et al. 2012; Del Moral et al. 2012).”
MethodSelf-citationIntegrating Crop Growth Models with Whole Genome Prediction through Approximate Bayesian Computation
Technow, F., Messina, C. D., Totir, L. R., & Cooper, M. (2015) · PLOS ONE · doi:10.1371/journal.pone.0130855 · Cited by 265
“Of particular interest here are population or sequential Monte Carlo algorithms, which are based on importance sampling [78, 83, 84].”
BackgroundApproximate Bayesian computation (ABC) gives exact results under the assumption of model error
Wilkinson, R. D. (2013) · Statistical Applications in Genetics and Molecular Biology · doi:10.1515/sagmb-2013-0010 · Cited by 247
Metadata
- Authors
- Peters, G. W., Fan, Y., & Sisson, S. A.
- Affiliations
- Commonwealth Scientific and Industrial Research Organisation (AU)
- UNSW Sydney (AU)
- Corresponding author
- Sisson, S. A.
- Venue
- Statistics and Computing
- Published
- 2012-02-15
- Volume
- 22
- Issue
- 6
- Pages
- 1209-1222
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2048509028
- Cited by
- 69
- References
- 60
- Citations by year
- 2026: 1 · 2025: 4 · 2024: 1 · 2023: 6 · 2021: 3 · 2020: 4 · 2018: 5 · 2017: 7 · 2016: 3 · 2015: 9 · 2014: 4 · 2013: 7 · 2012: 4
- FWCI
- 7.35
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Statistics and Computing (publishedVersion)
- Funders
- Australian Research Council
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Markov Chains and Monte Carlo Methods
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Bayesian Inference
- Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
- Keywords
- sequential Monte Carlo, approximate Bayesian computation, central limit theorem
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On sequential Monte Carlo, partial rejection control and approximate Bayesian computation. https://app.cochat.ai/papers/10.1007/s11222-012-9315-y
- The paper
- Peters, G. W., Fan, Y., & Sisson, S. A. (2012). On sequential Monte Carlo, partial rejection control and approximate Bayesian computation. Statistics and Computing. https://doi.org/10.1007/s11222-012-9315-y
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.