Multifidelity approximate Bayesian computation

From MaRDI portal
Publication:4960985

DOI10.1137/18M1229742zbMATH Open1436.62097arXiv1811.09550OpenAlexW3000269992WikidataQ126347139 ScholiaQ126347139MaRDI QIDQ4960985FDOQ4960985


Authors: Thomas P. Prescott, Ruth E. Baker Edit this on Wikidata


Publication date: 24 April 2020

Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)

Abstract: A vital stage in the mathematical modelling of real-world systems is to calibrate a model's parameters to observed data. Likelihood-free parameter inference methods, such as Approximate Bayesian Computation, build Monte Carlo samples of the uncertain parameter distribution by comparing the data with large numbers of model simulations. However, the computational expense of generating these simulations forms a significant bottleneck in the practical application of such methods. We identify how simulations of cheap, low-fidelity models have been used separately in two complementary ways to reduce the computational expense of building these samples, at the cost of introducing additional variance to the resulting parameter estimates. We explore how these approaches can be unified so that cost and benefit are optimally balanced, and we characterise the optimal choice of how often to simulate from cheap, low-fidelity models in place of expensive, high-fidelity models in Monte Carlo ABC algorithms. The resulting early accept/reject multifidelity ABC algorithm that we propose is shown to give improved performance over existing multifidelity and high-fidelity approaches.


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




Recommendations




Cites Work


Cited In (6)

Uses Software





This page was built for publication: Multifidelity approximate Bayesian computation

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