Papers › Limitations of the Empirical Fisher Approximation for Natural Gradient Descent

Limitations of the Empirical Fisher Approximation for Natural Gradient Descent

29 May 2019NeurIPS 2019 12arXiv:1905.12558archive 2025-07-28

Frederik Kunstner, Lukas Balles, Philipp Hennig

Natural gradient descent, which preconditions a gradient descent update with the Fisher information matrix of the underlying statistical model, is a way to capture partial second-order information. Several highly visible works have advocated an approximation known as the empirical Fisher, drawing connections between approximate second-order methods and heuristics like Adam. We dispute this argument by showing that the empirical Fisher---unlike the Fisher---does not generally capture second-order information. We further argue that the conditions under which the empirical Fisher approaches the Fisher (and the Hessian) are unlikely to be met in practice, and that, even on simple optimization problems, the pathologies of the empirical Fisher can have undesirable effects.

PaperPDFConference PDFCode

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

Code

fkunstner/limitations-empirical-fisher officialmentioned in papermentioned on GitHub 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.

Code Syntology ran Syntology

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

Tasks

Second-order methods

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