mlsanityData to 7 Oct 2026

A Novel Structured Natural Gradient Descent for Deep Learning

arXiv 2109.10100 ↗First posted 21 Sep 2021cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Natural gradient descent (NGD) provided deep insights and powerful tools to deep neural networks. However the computation of Fisher information matrix becomes more and more difficult as the network structure turns large and complex. This paper proposes a new optimization method whose main idea is to accurately replace the natural gradient optimization by reconstructing the network. More specifically, we reconstruct the structure of the deep neural network, and optimize the new network using traditional gradient descent (GD). The reconstructed network achieves the effect of the optimization way with natural gradient descent. Experimental results show that our optimization method can accelerate the convergence of deep network models and achieve better performance than GD while sharing its computational simplicity.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 21 references that are in the map. First posted on arXiv 21 Sep 2021.

Builds on

9 of 21 references.

References · 9

  1. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  2. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
  3. 2018Group Normalizationcited by 1,514
  4. 2019Semantic Image Synthesis with Spatially-Adaptive Normalizationcited by 1,295
  5. 2016Instance Normalization: The Missing Ingredient for Fast Stylizationcited by 1,187
  6. 2016Weight Normalization: A Simple Reparameterization to Accelerate Training of Deep Neural Networkscited by 541
  7. 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 143
  8. 2019Fast Convergence of Natural Gradient Descent for Overparameterized Neural Networkscited by 76
  9. 2017Improved Bilinear Pooling with CNNscited by 29

Built on by

Not cited yet.