Stochastic natural gradient descent draws posterior samples in function space
Not on the map. Why?
Abstract (arXiv)
Recent work has argued that stochastic gradient descent can approximate the Bayesian uncertainty in model parameters near local minima. In this work we develop a similar correspondence for minibatch natural gradient descent (NGD). We prove that for sufficiently small learning rates, if the model predictions on the training set approach the true conditional distribution of labels given inputs, the stationary distribution of minibatch NGD approaches a Bayesian posterior near local minima. The temperature T = ε N / (2B) is controlled by the learning rate ε, training set size N and batch size B. However minibatch NGD is not parameterisation invariant and it does not sample a valid posterior away from local minima. We therefore propose a novel optimiser, "stochastic NGD", which introduces the additional correction terms required to preserve both properties.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jun 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 3; 2025: 1.
4 papers.
- 2024Stochastic weight matrix dynamics during learning and Dyson Brownian motioncited by 7
- 2025Generalization performance of narrow one-hidden layer networks in the teacher-student settingcited by 2
- 2024Upper Bound of Bayesian Generalization Error in Partial Concept Bottleneck Model (CBM): Partial CBM outperforms naive CBMcited by 1
- 2024Random Matrix Theory for Stochastic Gradient Descentcited by 0
- 2025Generalization performance of narrow one-hidden layer networks in the teacher-student setting1 Jul 2025
- 2024Random Matrix Theory for Stochastic Gradient Descent29 Dec 2024
- 2024Stochastic weight matrix dynamics during learning and Dyson Brownian motion23 Jul 2024
- 2024Upper Bound of Bayesian Generalization Error in Partial Concept Bottleneck Model (CBM): Partial CBM outperforms naive CBM14 Mar 2024