Papers › Noisy Natural Gradient as Variational Inference

Noisy Natural Gradient as Variational Inference

6 Dec 2017ICML 2018 7arXiv:1712.02390archive 2025-07-28

Guodong Zhang, Shengyang Sun, David Duvenaud, Roger Grosse

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.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

gd-zhang/noisy-K-FAC mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Optimizing Neural Networks with Kronecker-factored Approximate Curvature (arXiv:1503.05671; that paper's own run record: 48 ran (of which 20 constructed an object rather than computing a result; 36 with no instrument failure: 5 honoured, 1 violated, 30 with no contract checked; 12 where Syntology's instrument failed) · 34 unverified); nothing checks that they implement this paper's method. report
minfanzhang/noisy-K-FAC_added_flipout mentioned on GitHubtfSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Active LearningEfficient ExplorationReinforcement LearningReinforcement Learning (RL)Variational Inference

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Adam

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections