Convergence of projected stochastic natural gradient variational inference for various step size and sample or batch size schedules
Not on the map. Why?
Abstract (arXiv)
Stochastic natural gradient variational inference (NGVI) is a popular and efficient algorithm for Bayesian inference. Despite empirical success, the convergence of this method is still not fully understood. In this work, we define and study a projected stochastic NGVI when variational distributions form an exponential family. Stochasticity arises when either gradients are intractable expectations or large sums. We prove new non-asymptotic convergence results for combinations of constant or decreasing step sizes and constant or increasing sample/batch sizes. When all hyperparameters are fixed, NGVI is shown to converge geometrically to a neighborhood of the optimum, while we establish convergence to the optimum with rates of the form Oleft(frac1Tρ right), possibly with ρ ≥ 1, for all other combinations of step size and sample/batch size schedules. These rates apply when the target posterior distribution is close in some sense to the considered exponential family. Our theoretical results extend existing NGVI and stochastic optimization results and provide more flexibility to adjust, in a principled way, step sizes and sample/batch sizes in order to meet speed, resources, or accuracy constraints.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 55 references that are in the map. First posted on arXiv 1 Apr 2026.
Builds on
27 of 55 references.
References · 27
- 2014New insights and perspectives on the natural gradient methodcited by 435
- 2013Black Box Variational Inferencecited by 317
- 2017Advances in Variational Inferencecited by 236
- 2013Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimizationcited by 142
- 2016Relatively-Smooth Convex Optimization by First-Order Methods, and Applicationscited by 108
- 2021The Bayesian Learning Rulecited by 95
- 2022Variational inference via Wasserstein gradient flowscited by 84
- 2017Concentration of tempered posteriors and of their variational approximationscited by 66
- 2017Frequentist Consistency of Variational Bayescited by 60
- 2013The Information Geometry of Mirror Descentcited by 53
- 2019Fast and Simple Natural-Gradient Variational Inference with Mixture of Exponential-family Approximationscited by 51
- 2018Fast yet Simple Natural-Gradient Descent for Variational Inference in Complex Modelscited by 37
15 more
- 2023Forward-backward Gaussian variational inference via JKO in the Bures-Wasserstein Spacecited by 36
- 2020Handling the Positive-Definite Constraint in the Bayesian Learning Rulecited by 31
- 2023Provable convergence guarantees for black-box variational inferencecited by 29
- 2023On the Convergence of Black-Box Variational Inferencecited by 22
- 2019Provable Gradient Variance Guarantees for Black-Box Variational Inferencecited by 21
- 2015Faster Stochastic Variational Inference using Proximal-Gradient Methods with General Divergence Functionscited by 19
- 2021Fast Stochastic Bregman Gradient Methods: Sharp Analysis and Variance Reductioncited by 19
- 2018Fastest Rates for Stochastic Mirror Descent Methodscited by 14
- 2024Variational Inference in Location-Scale Families: Exact Recovery of the Mean and Correlation Matrixcited by 9
- 2018A Proximal Approach for a Class of Matrix Optimization Problemscited by 8
- 2024Understanding Stochastic Natural Gradient Variational Inferencecited by 8
- 2023Wasserstein Gradient Flow over Variational Parameter Space for Variational Inferencecited by 5
- 2023Natural Gradient Variational Bayes without Fisher Matrix Analytic Calculation and Its Inversioncited by 3
- 2025Optimization Guarantees for Square-Root Natural-Gradient Variational Inferencecited by 3
- 2025Natural Gradient VI: Guarantees for Non-Conjugate Modelscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.