English

Practical and Matching Gradient Variance Bounds for Black-Box Variational Bayesian Inference

Machine Learning 2023-06-06 v4 Optimization and Control Computation Machine Learning

Abstract

Understanding the gradient variance of black-box variational inference (BBVI) is a crucial step for establishing its convergence and developing algorithmic improvements. However, existing studies have yet to show that the gradient variance of BBVI satisfies the conditions used to study the convergence of stochastic gradient descent (SGD), the workhorse of BBVI. In this work, we show that BBVI satisfies a matching bound corresponding to the ABCABC condition used in the SGD literature when applied to smooth and quadratically-growing log-likelihoods. Our results generalize to nonlinear covariance parameterizations widely used in the practice of BBVI. Furthermore, we show that the variance of the mean-field parameterization has provably superior dimensional dependence.

Cite

@article{arxiv.2303.10472,
  title  = {Practical and Matching Gradient Variance Bounds for Black-Box Variational Bayesian Inference},
  author = {Kyurae Kim and Kaiwen Wu and Jisu Oh and Jacob R. Gardner},
  journal= {arXiv preprint arXiv:2303.10472},
  year   = {2023}
}

Comments

Accepted to ICML'23 for live oral presentation

R2 v1 2026-06-28T09:22:36.260Z