PyVBMC: Efficient Bayesian inference in Python
Not on the map. Why?
Abstract (arXiv)
PyVBMC is a Python implementation of the Variational Bayesian Monte Carlo (VBMC) algorithm for posterior and model inference for black-box computational models (Acerbi, 2018, 2020). VBMC is an approximate inference method designed for efficient parameter estimation and model assessment when model evaluations are mildly-to-very expensive (e.g., a second or more) and/or noisy. Specifically, VBMC computes: - a flexible (non-Gaussian) approximate posterior distribution of the model parameters, from which statistics and posterior samples can be easily extracted; - an approximation of the model evidence or marginal likelihood, a metric used for Bayesian model selection. PyVBMC can be applied to any computational or statistical model with up to roughly 10-15 continuous parameters, with the only requirement that the user can provide a Python function that computes the target log likelihood of the model, or an approximation thereof (e.g., an estimate of the likelihood obtained via simulation or Monte Carlo methods). PyVBMC is particularly effective when the model takes more than about a second per evaluation, with dramatic speed-ups of 1-2 orders of magnitude when compared to traditional approximate inference methods. Extensive benchmarks on both artificial test problems and a large number of real models from the computational sciences, particularly computational and cognitive neuroscience, show that VBMC generally - and often vastly - outperforms alternative methods for sample-efficient Bayesian inference, and is applicable to both exact and simulator-based models (Acerbi, 2018, 2019, 2020). PyVBMC brings this state-of-the-art inference algorithm to Python, along with an easy-to-use Pythonic interface for running the algorithm and manipulating and visualizing its results.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 8 of its 22 references that are in the map. First posted on arXiv 16 Mar 2023.
Builds on
8 of 22 references.
References · 8
- 2014Sampling for Inference in Probabilistic Models with Fast Bayesian Quadraturecited by 31
- 2021Emulation of physical processes with Emukitcited by 24
- 2020Variational Bayesian Monte Carlo with Noisy Likelihoodscited by 23
- 2018Variational Bayesian Monte Carlocited by 20
- 2019Parallel Gaussian process surrogate Bayesian inference with noisy likelihood evaluationscited by 18
- 2017Adaptive Gaussian process approximation for Bayesian inference with expensive likelihood functionscited by 9
- 2022Fast and robust Bayesian Inference using Gaussian Processes with GPrycited by 5
- 2020Computing Bayes: Bayesian Computation from 1763 to the 21st Centurycited by 3
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 4.
7 papers.
- 2025Efficient Autoregressive Inference for Transformer Probabilistic Modelscited by 4
- 2023PyBADS: Fast and robust black-box optimization in Pythoncited by 3
- 2025PriorGuide: Test-Time Prior Adaptation for Simulation-Based Inferencecited by 3
- 2025Normalizing Flow Regression for Bayesian Inference with Offline Likelihood Evaluationscited by 1
- 2023Parallelized Acquisition for Active Learning using Monte Carlo Samplingcited by 0
- 2023LINFA: a Python library for variational inference with normalizing flow and annealingcited by 0
- 2025Measuring the right thing: justifying metrics in AI impact assessmentscited by 0
- 2025PriorGuide: Test-Time Prior Adaptation for Simulation-Based Inference15 Oct 2025
- 2025Efficient Autoregressive Inference for Transformer Probabilistic Models10 Oct 2025
- 2025Normalizing Flow Regression for Bayesian Inference with Offline Likelihood Evaluations15 Apr 2025
- 2025Measuring the right thing: justifying metrics in AI impact assessments7 Apr 2025
- 2023LINFA: a Python library for variational inference with normalizing flow and annealing10 Jul 2023
- 2023PyBADS: Fast and robust black-box optimization in Python27 Jun 2023
- 2023Parallelized Acquisition for Active Learning using Monte Carlo Sampling30 May 2023