Multi-fidelity Monte Carlo: a pseudo-marginal approach
Diana Cai, Ryan P. Adams

TL;DR
This paper introduces a pseudo-marginal multi-fidelity MCMC method that efficiently combines models of different fidelities to accurately approximate expensive target densities in scientific computations.
Contribution
It proposes an asymptotically exact multi-fidelity MCMC algorithm using a randomized estimator based on model sequences, improving computational efficiency.
Findings
Effective in log-Gaussian Cox process modeling
Applicable to Bayesian ODE system identification
Performs well in PDE-constrained optimization
Abstract
Markov chain Monte Carlo (MCMC) is an established approach for uncertainty quantification and propagation in scientific applications. A key challenge in applying MCMC to scientific domains is computation: the target density of interest is often a function of expensive computations, such as a high-fidelity physical simulation, an intractable integral, or a slowly-converging iterative algorithm. Thus, using an MCMC algorithms with an expensive target density becomes impractical, as these expensive computations need to be evaluated at each iteration of the algorithm. In practice, these computations often approximated via a cheaper, low-fidelity computation, leading to bias in the resulting target density. Multi-fidelity MCMC algorithms combine models of varying fidelities in order to obtain an approximate target density with lower computational cost. In this paper, we describe a class of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Materials Science · Forecasting Techniques and Applications · Gaussian Processes and Bayesian Inference
MethodsGaussian Process
