Adaptive approximate Bayesian computation for complex models
AbstractWe propose a new approximate Bayesian computation (ABC) algorithm that aims at minimizing the number of model runs for reaching a given quality of the posterior approximation. This algorithm automatically determines its sequence of tolerance levels and makes use of an easily interpretable stopping criterion. Moreover, it avoids the problem of particle duplication found when using a MCMC kernel. When applied to a toy example and to a complex social model, our algorithm is 2–8 times faster than the three main sequential ABC algorithms currently available. Copyright Springer-Verlag Berlin Heidelberg 2013
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Computational Statistics.
Volume (Year): 28 (2013)
Issue (Month): 6 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=120306
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Joyce Paul & Marjoram Paul, 2008. "Approximately Sufficient Statistics and Bayesian Computation," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 7(1), pages 1-18, August.
- Mark A. Beaumont & Jean-Marie Cornuet & Jean-Michel Marin & Christian P. Robert, 2009. "Adaptive approximate Bayesian computation," Biometrika, Biometrika Trust, vol. 96(4), pages 983-990.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.