Multilevel rejection sampling for approximate Bayesian computation

From MaRDI portal
Publication:1662859

DOI10.1016/J.CSDA.2018.02.009zbMATH Open1469.62160arXiv1702.03126OpenAlexW2616545773WikidataQ130185824 ScholiaQ130185824MaRDI QIDQ1662859FDOQ1662859

David J. Warne, Ruth E. Baker, Matthew J. Simpson

Publication date: 20 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Abstract: Likelihood-free methods, such as approximate Bayesian computation, are powerful tools for practical inference problems with intractable likelihood functions. Markov chain Monte Carlo and sequential Monte Carlo variants of approximate Bayesian computation can be effective techniques for sampling posterior distributions in an approximate Bayesian computation setting. However, without careful consideration of convergence criteria and selection of proposal kernels, such methods can lead to very biased inference or computationally inefficient sampling. In contrast, rejection sampling for approximate Bayesian computation, despite being computationally intensive, results in independent, identically distributed samples from the approximated posterior. An alternative method is proposed for the acceleration of likelihood-free Bayesian inference that applies multilevel Monte Carlo variance reduction techniques directly to rejection sampling. The resulting method retains the accuracy advantages of rejection sampling while significantly improving the computational efficiency.


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Multilevel rejection sampling for approximate Bayesian computation

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