mlsanityData to 7 Oct 2026

Linear Convergence of Black-Box Variational Inference: Should We Stick the Landing?

arXiv 2307.14642 ↗First posted 27 Jul 2023stat.ML cs.LG stat.COcited by 10

Not on the map. Why?

Abstract (arXiv)

We prove that black-box variational inference (BBVI) with control variates, particularly the sticking-the-landing (STL) estimator, converges at a geometric (traditionally called "linear") rate under perfect variational family specification. In particular, we prove a quadratic bound on the gradient variance of the STL estimator, one which encompasses misspecified variational families. Combined with previous works on the quadratic variance condition, this directly implies convergence of BBVI with the use of projected stochastic gradient descent. For the projection operator, we consider a domain with triangular scale matrices, which the projection onto is computable in Theta(d) time, where d is the dimensionality of the target posterior. We also improve existing analysis on the regular closed-form entropy gradient estimators, which enables comparison against the STL estimator, providing explicit non-asymptotic complexity guarantees for both.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 42 of its 82 references that are in the map. First posted on arXiv 27 Jul 2023.

Builds on

42 of 82 references.

References · 42

  1. 2016Variational Inference: A Review for Statisticianscited by 1,466
  2. 2013Black Box Variational Inferencecited by 317
  3. 2019Monte Carlo Gradient Estimation in Machine Learningcited by 281
  4. 2017Advances in Variational Inferencecited by 236
  5. 2019SGD: General Analysis and Improved Ratescited by 206
  6. 2013Minimizing Finite Sums with the Stochastic Average Gradientcited by 164
  7. 2016Automatic Differentiation Variational Inferencecited by 159
  8. 2023Handbook of Convergence Theorems for (Stochastic) Gradient Methodscited by 158
  9. 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
  10. 2018Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptroncited by 143
  11. 2018Log-concave sampling: Metropolis-Hastings algorithms are fastcited by 117
  12. 2017Sticking the Landing: Simple, Lower-Variance Gradient Estimators for Variational Inferencecited by 97
30 more
  1. 2018Tight Analyses for Non-Smooth Stochastic Gradient Descentcited by 94
  2. 2017Bridging the Gap between Constant Step Size Stochastic Gradient Descent and Markov Chainscited by 84
  3. 2020Variance-Reduced Methods for Machine Learningcited by 79
  4. 2018Tighter Variational Bounds are Not Necessarily Bettercited by 76
  5. 2017Concentration of tempered posteriors and of their variational approximationscited by 66
  6. 2013Fast Convergence of Stochastic Gradient Descent under a Strong Growth Conditioncited by 54
  7. 2018Variance reduction properties of the reparameterization trickcited by 41
  8. 2020Advances in Black-Box VI: Normalizing Flows, Importance Weighting, and Optimizationcited by 37
  9. 2016Importance Sampling for Minibatchescited by 36
  10. 2019Provable Smoothness Guarantees for Black-Box Variational Inferencecited by 29
  11. 2023Provable convergence guarantees for black-box variational inferencecited by 29
  12. 2017Reducing Reparameterization Gradient Variancecited by 27
  13. 2018Quasi-Monte Carlo Variational Inferencecited by 24
  14. 2023On the Convergence of Black-Box Variational Inferencecited by 22
  15. 2018Using Large Ensembles of Control Variates for Variational Inferencecited by 21
  16. 2019Provable Gradient Variance Guarantees for Black-Box Variational Inferencecited by 21
  17. 2020On the Difficulty of Unbiased Alpha Divergence Minimizationcited by 21
  18. 2015Faster Stochastic Variational Inference using Proximal-Gradient Methods with General Divergence Functionscited by 19
  19. 2020Non-exponentially weighted aggregation: regret bounds for unbounded loss functionscited by 18
  20. 2019A Generalization Bound for Online Variational Inferencecited by 17
  21. 2019Multilevel Monte Carlo Variational Inferencecited by 14
  22. 2018Practical bounds on the error of Bayesian posterior approximations: A nonasymptotic approachcited by 12
  23. 2020Approximation Based Variance Reduction for Reparameterization Gradientscited by 10
  24. 2015Fast Second-Order Stochastic Backpropagation for Variational Inferencecited by 8
  25. 2021The computational asymptotics of Gaussian variational inference and the Laplace approximationcited by 8
  26. 2017Fast Black-box Variational Inference through Stochastic Trust-Region Optimizationcited by 7
  27. 2022Statistical and Computational Trade-offs in Variational Inference: A Case Study in Inferential Model Selectioncited by 7
  28. 2023Practical and Matching Gradient Variance Bounds for Black-Box Variational Bayesian Inferencecited by 6
  29. 2019A Rule for Gradient Estimator Selection, with an Application to Variational Inferencecited by 5
  30. 2020On Signal-to-Noise Ratio Issues in Variational Inference for Deep Gaussian Processescited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 3; 2026: 3.

10 papers.