Multifidelity approximate Bayesian computation
From MaRDI portal
Publication:4960985
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.
Recommendations
- Multifidelity approximate Bayesian computation with sequential Monte Carlo parameter sampling
- Multilevel Monte Carlo in approximate Bayesian computation
- The rate of convergence for approximate Bayesian computation
- Adaptive approximate Bayesian computation for complex models
- Approximate Bayesian computational methods
Cites work
- A Survey of Model Reduction by Balanced Truncation and Some New Results
- A survey of projection-based model reduction methods for parametric dynamical systems
- AABC: approximate approximate Bayesian computation for inference in population-genetic models
- An adaptive sequential Monte Carlo method for approximate Bayesian computation
- Approximation of Large-Scale Dynamical Systems
- Constructing summary statistics for approximate Bayesian computation: semi-automatic approximate Bayesian computation. With discussion and authors' reply
- Data-driven model reduction for the Bayesian solution of inverse problems
- Gaussian processes for machine learning.
- Guaranteed error bounds for structured complexity reduction of biochemical networks
- Handbook of approximate Bayesian computation
- Lazy ABC
- Methods of model reduction for large-scale biological systems: a survey of current methods and trends
- Model reduction and approximation. Theory and algorithms
- Modeling and Simulating Chemical Reactions
- Multilevel Monte Carlo Path Simulation
- Multilevel rejection sampling for approximate Bayesian computation
- Optimal model management for multifidelity Monte Carlo estimation
- Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction
- Statistical properties of an early stopping rule for resampling-based multiple testing
- Survey of multifidelity methods in uncertainty propagation, inference, and optimization
- Unbiased estimation with square root convergence for SDE models
Cited in
(6)- scientific article; zbMATH DE number 3969846 (Why is no real title available?)
- Multifidelity approximate Bayesian computation with sequential Monte Carlo parameter sampling
- Efficient multifidelity likelihood-free Bayesian inference with adaptive computational resource allocation
- Multifidelity multilevel Monte Carlo to accelerate approximate Bayesian parameter inference for partially observed stochastic processes
- Active learning with multifidelity modeling for efficient rare event simulation
- Rapid Bayesian Inference for Expensive Stochastic Models
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)
