mlsanityData to 14 Oct 2026

An Improved Empirical Fisher Approximation for Natural Gradient Descent

arXiv 2406.06420 ↗First posted 10 Jun 2024cs.LGcited by 15

Not on the map. Why?

Abstract (arXiv)

Approximate Natural Gradient Descent (NGD) methods are an important family of optimisers for deep learning models, which use approximate Fisher information matrices to pre-condition gradients during training. The empirical Fisher (EF) method approximates the Fisher information matrix empirically by reusing the per-sample gradients collected during back-propagation. Despite its ease of implementation, the EF approximation has its theoretical and practical limitations. This paper investigates the inversely-scaled projection issue of EF, which is shown to be a major cause of its poor empirical approximation quality. An improved empirical Fisher (iEF) method is proposed to address this issue, which is motivated as a generalised NGD method from a loss reduction perspective, meanwhile retaining the practical convenience of EF. The exact iEF and EF methods are experimentally evaluated using practical deep learning setups. Optimisation experiments show that applying exact iEF directly as an optimiser provides strong convergence and generalisation. Additionally, under a novel empirical evaluation framework, the proposed iEF method shows consistently better approximation quality to exact Natural Gradient updates than both the EF and the more expensive sampled Fisher methods, meanwhile demonstrating the superior property of being robust to the choice of damping across tasks and training stages. Improving existing approximate NGD optimisers with iEF is expected to lead to better convergence and robustness. Furthermore, the iEF method also serves as a better approximation method to the Fisher information matrix itself, which enables the improvement of a variety of Fisher-based methods, not limited to the scope of optimisation.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 29 of its 56 references that are in the map. First posted on arXiv 10 Jun 2024.

Builds on

29 of 56 references.

References · 29

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  5. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  6. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  7. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  8. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  9. 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
  10. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,795
  11. 2015Trust Region Policy Optimizationcited by 2,580
  12. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
17 more
  1. 2014New insights and perspectives on the natural gradient methodcited by 443
  2. 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
  3. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
  4. 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 146
  5. 2022Parameter-efficient Model Adaptation for Vision Transformerscited by 81
  6. 2019Fast Convergence of Natural Gradient Descent for Overparameterized Neural Networkscited by 76
  7. 2020Practical Quasi-Newton Methods for Training Deep Neural Networkscited by 68
  8. 2017Variants of RMSProp and Adagrad with Logarithmic Regret Boundscited by 50
  9. 2019On the interplay between noise and curvature and its effect on optimization and generalizationcited by 44
  10. 2018Large-Scale Distributed Second-Order Optimization Using Kronecker-Factored Approximate Curvature for Deep Convolutional Neural Networkscited by 37
  11. 2019Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networkscited by 33
  12. 2022Gradient Descent on Neurons and its Link to Approximate Second-Order Optimizationcited by 30
  13. 2021Tensor Normal Training for Deep Learning Modelscited by 24
  14. 2020Convolutional Neural Network Training with Distributed K-FACcited by 22
  15. 2022A Mini-Block Fisher Method for Deep Neural Networkscited by 8
  16. 2023ISAAC Newton: Input-based Approximate Curvature for Newton's Methodcited by 6
  17. 2020Eigenvalue-corrected Natural Gradient Based on a New Approximationcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 8; 2026: 6.

15 papers.

Sort:

By area: