Natural Gradient VI: Guarantees for Non-Conjugate Models
Not on the map. Why?
Abstract (arXiv)
Stochastic Natural Gradient Variational Inference (NGVI) is a widely used method for approximating posterior distribution in probabilistic models. Despite its empirical success and foundational role in variational inference, its theoretical underpinnings remain limited, particularly in the case of non-conjugate likelihoods. While NGVI has been shown to be a special instance of Stochastic Mirror Descent, and recent work has provided convergence guarantees using relative smoothness and strong convexity for conjugate models, these results do not extend to the non-conjugate setting, where the variational loss becomes non-convex and harder to analyze. In this work, we focus on mean-field parameterization and advance the theoretical understanding of NGVI in three key directions. First, we derive sufficient conditions under which the variational loss satisfies relative smoothness with respect to a suitable mirror map. Second, leveraging this structure, we propose a modified NGVI algorithm incorporating non-Euclidean projections and prove its global non-asymptotic convergence to a stationary point. Finally, under additional structural assumptions about the likelihood, we uncover hidden convexity properties of the variational loss and establish fast global convergence of NGVI to a global optimum. These results provide new insights into the geometry and convergence behavior of NGVI in challenging inference settings.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 38 of its 66 references that are in the map. First posted on arXiv 22 Oct 2025.
Builds on
38 of 66 references.
References · 38
- 2016Variational Inference: A Review for Statisticianscited by 1,472
- 2014New insights and perspectives on the natural gradient methodcited by 443
- 2013Black Box Variational Inferencecited by 319
- 2019Practical Deep Learning with Bayesian Principlescited by 158
- 2021Policy Mirror Descent for Reinforcement Learning: Linear Convergence, New Sampling Complexity, and Generalized Problem Classescited by 156
- 2013Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimizationcited by 143
- 2022On the Convergence Rates of Policy Gradient Methodscited by 119
- 2016Relatively-Smooth Convex Optimization by First-Order Methods, and Applicationscited by 108
- 2017Noisy Natural Gradient as Variational Inferencecited by 94
- 2017Conjugate-Computation Variational Inference : Converting Variational Inference in Non-Conjugate Models to Inferences in Conjugate Modelscited by 65
- 2014Linear Coupling: An Ultimate Unification of Gradient and Mirror Descentcited by 58
- 2013The Information Geometry of Mirror Descentcited by 54
26 more
- 2019Fast and Simple Natural-Gradient Variational Inference with Mixture of Exponential-family Approximationscited by 51
- 2018Natural Gradients in Practice: Non-Conjugate Variational Inference in Gaussian Process Modelscited by 38
- 2013Automated Variational Inference in Probabilistic Programmingcited by 34
- 2019Provable Smoothness Guarantees for Black-Box Variational Inferencecited by 29
- 2023Provable convergence guarantees for black-box variational inferencecited by 29
- 2022Mirror Descent Strikes Again: Optimal Stochastic Convex Optimization under Infinite Noise Variancecited by 24
- 2022A Unified Perspective on Natural Gradient Variational Inference with Gaussian Mixture Modelscited by 22
- 2023On the Convergence of Black-Box Variational Inferencecited by 22
- 2015Faster Stochastic Variational Inference using Proximal-Gradient Methods with General Divergence Functionscited by 19
- 2018On the Convergence Rate of Stochastic Mirror Descent for Nonsmooth Nonconvex Optimizationcited by 18
- 2019A Generalization Bound for Online Variational Inferencecited by 17
- 2018Fastest Rates for Stochastic Mirror Descent Methodscited by 14
- 2024Bayesian Online Natural Gradient (BONG)cited by 14
- 2023Provably Fast Convergence of Independent Natural Policy Gradient for Markov Potential Gamescited by 13
- 2023Stochastic Optimization under Hidden Convexitycited by 12
- 2024Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergencecited by 11
- 2023Linear Convergence of Black-Box Variational Inference: Should We Stick the Landing?cited by 10
- 2024Posterior and variational inference for deep neural networks with heavy-tailed weightscited by 10
- 2024Understanding Stochastic Natural Gradient Variational Inferencecited by 8
- 2018Stochastic model-based minimization under high-order growthcited by 7
- 2019A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minimacited by 6
- 2023Mean-field variational inference with the TAP free energy: Geometric and statistical properties in linear modelscited by 5
- 2019The Variational Predictive Natural Gradientcited by 4
- 2024A Particle Algorithm for Mean-Field Variational Inferencecited by 3
- 2025Natural Variational Annealing for Multimodal Optimizationcited by 3
- 2024Investigating Variance Definitions for Mirror Descent with Relative Smoothnesscited by 1
Built on by
Citing papers per year: 2026: 3.
3 papers.
- 2026Convergence of projected stochastic natural gradient variational inference for various step size and sample or batch size schedulescited by 1
- 2026Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Spacecited by 0
- 2026SGD for Variational Inference: Tackling Unbounded Variance via Preconditioning and Dynamic Batchingcited by 0
- 2026SGD for Variational Inference: Tackling Unbounded Variance via Preconditioning and Dynamic Batching8 May 2026
- 2026Convergence of projected stochastic natural gradient variational inference for various step size and sample or batch size schedules1 Apr 2026
- 2026Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Space21 Feb 2026