details: | Stuart Barber, Jochen Voss and Mark Webster: The Rate of Convergence for Approximate Bayesian Computation. Electronic Journal of Statistics, vol. 9, pp. 80–105, 2015. |
---|---|
online: | DOI:10.1214/15-EJS988 |
preprint: | arXiv:1311.2038, preprint:pdf |
metadata: | BibTeX, Google |
keywords: | Approximate Bayesian Computation, likelihood-free inference, Monte Carlo methods, convergence of estimators, rate of convergence |
Approximate Bayesian Computation (ABC) is a popular computational
method for likelihood-free Bayesian inference. The term
likelihood-free
refers to problems where the likelihood is
intractable to compute or estimate directly, but where it is possible to
generate simulated data X relatively easily given a candidate
set of parameters θ simulated from a prior distribution.
Parameters which generate simulated data within some
tolerance δ of the observed data x^{ast}
are regarded as plausible, and a collection of such θ is used to
estimate the posterior distribution
θ,|,X!=!x^{ast}. Suitable choice
of δ is vital for ABC methods to return good approximations
to θ in reasonable computational time. While ABC methods are
widely used in practice, particularly in population genetics, study of the
mathematical properties of ABC estimators is still in its infancy. We
prove that ABC estimates converge to the exact solution under very weak
assumptions and, under slightly stronger assumptions, quantify the rate of
this convergence. Our results can be used to guide the choice of the
tolerance parameter δ.
Copyright © 2017, Jochen Voss. All content on this website (including text, pictures, and any other original works), unless otherwise noted, is licensed under a Creative Commons Attribution-Share Alike 3.0 License.