The rate of convergence for approximate Bayesian computation

From MaRDI portal
Publication:2259529

DOI10.1214/15-EJS988zbMATH Open1307.62063arXiv1311.2038WikidataQ59897773 ScholiaQ59897773MaRDI QIDQ2259529FDOQ2259529

S. Barber, Mark Webster, Jochen Voss

Publication date: 4 March 2015

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Abstract: 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 heta simulated from a prior distribution. Parameters which generate simulated data within some tolerance delta of the observed data x* are regarded as plausible, and a collection of such heta is used to estimate the posterior distribution heta,|,X!=!x*. Suitable choice of delta is vital for ABC methods to return good approximations to heta 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 delta.


Full work available at URL: https://arxiv.org/abs/1311.2038




Recommendations




Cites Work


Cited In (18)

Uses Software





This page was built for publication: The rate of convergence for approximate Bayesian computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259529)