# Variational Stochastic Gradient Descent for Deep Neural Networks

Source: [Variational Stochastic Gradient Descent for Deep Neural Networks](<https://www.sota2.com/research/paper/68fa781b1e209131cea76d14>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-26T04:32:25.977Z

Authors: Haotian Chen, Anna Kuzina, Babak Esmaeili, Jakub M Tomczak

Published: 2024-04-09T18:02:01.000Z

## Abstract

Current state-of-the-art optimizers are adaptive gradient-based optimization methods such as Adam. Recently, there has been an increasing interest in formulating gradient-based optimizers in a probabilistic framework for better modeling the uncertainty of the gradients. Here, we propose to combine both approaches, resulting in the Variational Stochastic Gradient Descent (VSGD) optimizer. We model gradient updates as a probabilistic model and utilize stochastic variational inference (SVI) to derive an efficient and effective update rule. Further, we show how our VSGD method relates to other adaptive gradient-based optimizers like Adam. Lastly, we carry out experiments on two image classification datasets and four deep neural network architectures, where we show that VSGD outperforms Adam and SGD.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2404.06549>)

[PDF](<https://arxiv.org/pdf/2404.06549.pdf>)
