Efficient MCMC Schemes for Computationally Expensive Posterior Distributions

Abstract

We consider Markov chain Monte Carlo (MCMC) computational schemes intended to minimize the number of evaluations of the posterior distribution in Bayesian inference when the posterior is computationally expensive to evaluate. Our motivation is Bayesian calibration of computationally expensive computer models. An algorithm suggested previously in the literature based on hybrid Monte Carlo and a Gaussian process approximation to the target distribution is extended in three ways. First, we consider combining the original method with tempering schemes in order to deal with multimodal posterior distributions. Second, we consider replacing the original target posterior distribution with the Gaussian process approximation, which requires less computation to evaluate. Third, we consider in the context of tempering schemes the replacement of the true target distribution with the approximation in the high temperature chains while retaining the true target in the lowest temperature chain. This retains the correct target distribution in the lowest temperature chain while avoiding the computational expense of running the computer model in moves involving the high temperatures. Application of our methodology is considered to calibration of a rainfall-runoff model where multimodality of the parameter posterior is observed.