2025/12/01 by Nico Daheim, Daheim, Nico, Thomas Möllenhoff +5
Computer Science · #Artificial Intelligence (cs.AI) #Bayes' theorem #Bayesian probability #Extension (predicate logic) #FOS: Computer and information sciences #Gaussian #Generative Adversarial Networks and Image Synthesis #Gradient descent #Hessian matrix #Machine Learning (cs.LG) #Natural Language Processing Techniques #Posterior probability #Topic Modeling
paper · open access · doi:10.48550/arxiv.2512.01930
published in TUbilio (Technical University of Darmstadt) (Technische Universität Darmstadt)
openalex publication_date 2025/12/01 · openalex created_date 2025/12/03 · openalex updated_date 2026/07/28
Stochastic Variance Reduced Gradient (SVRG) and its variants aim to speed-up training by using gradient corrections. Originally proposed over a decade ago, these methods have never been connected to any Bayesian method at a fundamental level. Here, we fill this gap and derive surprising new connections of SVRG to a recently proposed Bayesian method called `posterior correction'. Our main contribution is to show that SVRG can be recovered as a special case of posterior-correction over isotropic-Gaussian posteriors. Novel extensions of SVRG are automatically obtained by using more flexible exponential-family posteriors. We derive two new such extensions by using Gaussian families: a Newton-like variant with novel Hessian corrections, and an Adam-like extension that scales to large problems. Our work is the first to connect SVRG to Bayes and use it to speed-up training.