How Far is Adam from Natural Gradient Descent?
Description
Adam is the standard optimizer in deep learning, yet its geometric relationship to natural gra-
dient descent (NGD) contains unresolved questions. We study Adam’s full update rule, includ-
ing momentum, as a diagonal empirical Fisher approximation subject to diagonal truncation,
empirical label substitution, and temporal lag. Using the scale-invariant γ(∆θ) metric, we mea-
sure Adam’s geometric deviation from true NGD across four loss landscapes: well-conditioned
linear regression, ill-conditioned linear regression, logistic regression, and a non-convex small
neural network. Adam’s geometric trajectory is context-dependent. Deviation remains low in
well-conditioned settings but rises significantly under ill-conditioning, reaching misalignments of
≈ 103 in the neural network. Higher geometric drift correlates with slower initial optimization
but does not degrade final objective minimization; Adam consistently reaches low loss. Further-
more, the improved empirical Fisher (iEF) tracks more stable paths than the standard empirical
Fisher (EF), which frequently oscillates or diverges. Our results suggest Adam’s practical op-
timization power may stem from a balance of structural approximation errors and momentum
smoothing rather than close tracking of the natural gradient path.
Files
How_Far_is_Adam_from_Natural_Gradient_Descent_(1.1).pdf
Additional details
Dates
- Issued
-
2026-05-19
Software
- Repository URL
- https://github.com/HobbesTheComputerScientist/adam-ngd-geometric-analysis
- Programming language
- Python
- Development Status
- Active