Fast post-process Bayesian inference with Sparse Variational Bayesian Monte Carlo

Abstract

We introduce Sparse Variational Bayesian Monte Carlo (svbmc), a method for fast "post-process" Bayesian inference for models with black-box and potentially noisy likelihoods. svbmc reuses all existing target density evaluations -for example, from previous optimizations or partial Markov Chain Monte Carlo runs -to build a sparse Gaussian process (GP) surrogate model of the log posterior density. Uncertain regions of the surrogate are then refined via active learning as needed. Our work builds on the Variational Bayesian Monte Carlo (vbmc) framework for sample-efficient inference, with several novel contributions. First, we make vbmc scalable to a large number of pre-existing evaluations via sparse GP regression, deriving novel Bayesian quadrature formulae and acquisition functions for active learning with sparse GPs. Second, we introduce noise shaping, a general technique to induce the sparse GP approximation to focus on high posterior density regions. Third, we prove theoretical results in support of the svbmc refinement procedure. We validate our method on a variety of challenging synthetic scenarios and real-world applications. We find that svbmc consistently builds good posterior approximations by post-processing of existing model evaluations from different sources, often requiring only a small number of additional density evaluations.

Fast and robust Bayesian inference using Gaussian processes with GPry

“…Alternative emulator-based approaches, relying on Variational Inference, have also been proposed, e.g. combined with a GP surrogate model to reduce the number of posterior evaluations [67][68][69][70], or targeted towards high dimensionalities but allowing for numbers of evaluations similar to MCMC [71,72].…”