Accelerating Asymptotically Exact MCMC for Computationally Intensive Models via Local Approximations
Patrick R. Conrad
Youssef M. Marzouk
Natesh S. Pillai
Aaron Smith
10.6084/m9.figshare.1581629
https://tandf.figshare.com/articles/Accelerating_Asymptotically_Exact_MCMC_for_Computationally_Intensive_Models_via_Local_Approximations/1581629
<p>We construct a new framework for accelerating Markov chain Monte Carlo in posterior sampling problems where standard methods are limited by the computational cost of the likelihood, or of numerical models embedded therein. Our approach introduces local approximations of these models into the Metropolisâ€“Hastings kernel, borrowing ideas from deterministic approximation theory, optimization, and experimental design. Previous efforts at integrating approximate models into inference typically sacrifice either the samplerâ€™s exactness or efficiency; our work seeks to address these limitations by exploiting useful convergence characteristics of local approximations. We prove the ergodicity of our approximate Markov chain, showing that it samples asymptotically from the <i>exact</i> posterior distribution of interest. We describe variations of the algorithm that employ either local polynomial approximations or local Gaussian process regressors. Our theoretical results reinforce the key observation underlying this article: when the likelihood has some local regularity, the number of model evaluations per Markov chain Monte Carlo (MCMC) step can be greatly reduced without biasing the Monte Carlo average. Numerical experiments demonstrate multiple order-of-magnitude reductions in the number of forward model evaluations used in representative ordinary differential equation (ODE) and partial differential equation (PDE) inference problems, with both synthetic and real data. Supplementary materials for this article are available online.</p>
2015-10-16 00:00:00
Approximation theory
Computer experiments
Emulators
Experimental design
Local approximation
Markov chain Monte Carlo