Noisy Natural Gradient as Variational Inference
Guodong Zhang, Shengyang Sun, David Duvenaud, Roger Grosse
TL;DR
The paper reveals a fundamental connection between natural gradient methods and variational inference for Bayesian neural networks, enabling Noisy Natural Gradient (NNG) as a practical training paradigm. By reinterpreting NG updates as variational updates with adaptive weight noise, it supports full-covariance, diagonal, matrix-variate Gaussian posteriors and scalable training via noisy Adam and noisy K-FAC. Empirical results show improved predictive uncertainty, calibration, and exploration across regression, classification, active learning, and reinforcement learning. This approach provides a scalable path to expressive variational posteriors in large neural networks, with tangible benefits for uncertainty-driven decision making.
Abstract
Variational Bayesian neural nets combine the flexibility of deep learning with Bayesian uncertainty estimation. Unfortunately, there is a tradeoff between cheap but simple variational families (e.g.~fully factorized) or expensive and complicated inference procedures. We show that natural gradient ascent with adaptive weight noise implicitly fits a variational posterior to maximize the evidence lower bound (ELBO). This insight allows us to train full-covariance, fully factorized, or matrix-variate Gaussian variational posteriors using noisy versions of natural gradient, Adam, and K-FAC, respectively, making it possible to scale up to modern-size ConvNets. On standard regression benchmarks, our noisy K-FAC algorithm makes better predictions and matches Hamiltonian Monte Carlo's predictive variances better than existing methods. Its improved uncertainty estimates lead to more efficient exploration in active learning, and intrinsic motivation for reinforcement learning.
