Efficient acquisition rules for model-based approximate Bayesian computation

No Thumbnail Available
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
Date
2019-06
Major/Subject
Mcode
Degree programme
Language
en
Pages
28
595-622
Series
Bayesian Analysis, Volume 14, issue 2
Abstract
Approximate Bayesian computation (ABC) is a method for Bayesian inference when the likelihood is unavailable but simulating from the model is possible. However, many ABC algorithms require a large number of simulations, which can be costly. To reduce the computational cost, Bayesian optimisation (BO) and surrogate models such as Gaussian processes have been proposed. Bayesian optimisation enables one to intelligently decide where to evaluate the model next but common BO strategies are not designed for the goal of estimating the posterior distribution. Our paper addresses this gap in the literature. We propose to compute the uncertainty in the ABC posterior density, which is due to a lack of simulations to estimate this quantity accurately, and define a loss function that measures this uncertainty. We then propose to select the next evaluation location to minimise the expected loss. Experiments show that the proposed method often produces the most accurate approximations as compared to common BO strategies.
Description
Keywords
Approximate Bayesian computation, Bayesian optimisation, Gaussian processes, Intractable likelihood, Sequential experiment design, MONTE-CARLO, STATISTICAL-INFERENCE, REDUCTION, sequential experiment design, approximate Bayesian computation, intractable likelihood
Other note
Citation
Järvenpää, M, Gutmann, M U, Pleska, A, Vehtari, A & Marttinen, P 2019, ' Efficient acquisition rules for model-based approximate Bayesian computation ', Bayesian Analysis, vol. 14, no. 2, pp. 595-622 . https://doi.org/10.1214/18-BA1121