Interpolating between sampling and variational inference with infinite stochastic mixtures
Not on the map. Why?
Abstract (arXiv)
Sampling and Variational Inference (VI) are two large families of methods for approximate inference that have complementary strengths. Sampling methods excel at approximating arbitrary probability distributions, but can be inefficient. VI methods are efficient, but may misrepresent the true distribution. Here, we develop a general framework where approximations are stochastic mixtures of simple component distributions. Both sampling and VI can be seen as special cases: in sampling, each mixture component is a delta-function and is chosen stochastically, while in standard VI a single component is chosen to minimize divergence. We derive a practical method that interpolates between sampling and VI by solving an optimization problem over a mixing distribution. Intermediate inference methods then arise by varying a single parameter. Our method provably improves on sampling (reducing variance) and on VI (reducing bias+variance despite increasing variance). We demonstrate our method's bias/variance trade-off in practice on reference problems, and we compare outcomes to commonly used sampling and VI methods. This work takes a step towards a highly flexible yet simple family of inference methods that combines the complementary strengths of sampling and VI.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 55 references that are in the map. First posted on arXiv 18 Oct 2021.
Builds on
21 of 55 references.
References · 21
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
- 2016Variational Inference: A Review for Statisticianscited by 1,466
- 2019On Variational Bounds of Mutual Informationcited by 550
- 2017Advances in Variational Inferencecited by 236
- 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 195
- 2016Automatic Differentiation Variational Inferencecited by 159
- 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
- 2015Hierarchical Variational Modelscited by 89
- 2018Semi-Implicit Variational Inferencecited by 55
- 2016Variational Boosting: Iteratively Refining Posterior Approximationscited by 36
9 more
- 2017Estimating Mixture Entropy with Pairwise Distancescited by 34
- 2021Pathfinder: Parallel quasi-Newton variational inferencecited by 26
- 2013Austerity in MCMC Land: Cutting the Metropolis-Hastings Budgetcited by 24
- 2016Patterns of Scalable Bayesian Inferencecited by 24
- 2020Variational Bayesian Monte Carlo with Noisy Likelihoodscited by 23
- 2016Boosting Variational Inferencecited by 22
- 2018Variational Bayesian Monte Carlocited by 20
- 2016Variational Inference with Hamiltonian Monte Carlocited by 17
- 2013Variational MCMCcited by 7
Built on by
Citing papers per year: 2023: 2; 2024: 1.
3 papers.
- 2023High Dimensional Causal Inference with Variational Backdoor Adjustmentcited by 3
- 2023Inferring Inferencecited by 1
- 2024How does the brain compute with probabilities?cited by 1
- 2024How does the brain compute with probabilities?1 Sep 2024
- 2023High Dimensional Causal Inference with Variational Backdoor Adjustment9 Oct 2023
- 2023Inferring Inference4 Oct 2023