Adaptive approximate Bayesian computation
Top Cited Papers
- 12 October 2009
- journal article
- research article
- Published by Oxford University Press (OUP) in Biometrika
- Vol. 96 (4) , 983-990
- https://doi.org/10.1093/biomet/asp052
Abstract
Sequential techniques can enhance the efficiency of the approximate Bayesian computation algorithm, as in Sisson et al.’s (2007) partial rejection control version. While this method is based upon the theoretical works of Del Moral et al. (2006), the application to approximate Bayesian computation results in a bias in the approximation to the posterior. An alternative version based on genuine importance sampling arguments bypasses this difficulty, in connection with the population Monte Carlo method of Cappé et al. (2004), and it includes an automatic scaling of the forward kernel. When applied to a population genetics example, it compares favourably with two other versions of the approximate algorithm.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Inferring population history withDIY ABC: a user-friendly approach to approximate Bayesian computationBioinformatics, 2008
- Adaptive importance sampling in general mixture classesStatistics and Computing, 2008
- Inference for Stereological ExtremesJournal of the American Statistical Association, 2007
- Sequential Monte Carlo without likelihoodsProceedings of the National Academy of Sciences, 2007
- Convergence of adaptive mixtures of importance sampling schemesThe Annals of Statistics, 2007
- Sequential Monte Carlo SamplersJournal of the Royal Statistical Society Series B: Statistical Methodology, 2006
- Population Monte CarloJournal of Computational and Graphical Statistics, 2004
- Markov chain Monte Carlo without likelihoodsProceedings of the National Academy of Sciences, 2003
- Approximate Bayesian Computation in Population GeneticsGenetics, 2002
- Population growth of human Y chromosomes: a study of Y chromosome microsatellitesMolecular Biology and Evolution, 1999