MLLGNCQMOct 12, 2018

Variational Bayesian Monte Carlo

arXiv:1810.05558v280 citations
Originality Highly original
AI Analysis

This addresses the challenge of sample-efficient inference in scientific computing and machine learning for expensive models, offering a novel tool for posterior and model inference.

The authors tackled the problem of Bayesian inference for models with expensive, black-box likelihoods, introducing Variational Bayesian Monte Carlo (VBMC) which efficiently approximates posteriors and model evidence with limited likelihood evaluations, performing well up to 10 dimensions.

Many probabilistic models of interest in scientific computing and machine learning have expensive, black-box likelihoods that prevent the application of standard techniques for Bayesian inference, such as MCMC, which would require access to the gradient or a large number of likelihood evaluations. We introduce here a novel sample-efficient inference framework, Variational Bayesian Monte Carlo (VBMC). VBMC combines variational inference with Gaussian-process based, active-sampling Bayesian quadrature, using the latter to efficiently approximate the intractable integral in the variational objective. Our method produces both a nonparametric approximation of the posterior distribution and an approximate lower bound of the model evidence, useful for model selection. We demonstrate VBMC both on several synthetic likelihoods and on a neuronal model with data from real neurons. Across all tested problems and dimensions (up to $D = 10$), VBMC performs consistently well in reconstructing the posterior and the model evidence with a limited budget of likelihood evaluations, unlike other methods that work only in very low dimensions. Our framework shows great promise as a novel tool for posterior and model inference with expensive, black-box likelihoods.

Code Implementations4 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes