Analysis of Natural Gradient Descent for Multilayer Neural Networks
Magnus Rattray, David Saad
Abstract
Natural gradient descent is a principled method for adapting the parameters of a statistical model on-line using an underlying Riemannian parameter space to redefine the direction of steepest descent. The algorithm is examined via methods of statistical physics which accurately characterize both transient and asymptotic behavior. A solution of the learning dynamics is obtained for the case of multilayer neural network training in the limit of large input dimension. We find that natural gradient learning leads to optimal asymptotic performance and outperforms gradient descent in the transient, significantly shortening or even removing plateaus in the transient generalization performance which typically hamper gradient descent training.
Create a lesson
Related papers
Testing Replica Symmetry Breaking in the three-dimensional Edwards-Anderson model by using vanishing fields
Miguel Aguilar-Janita, Silvio Franz, Victor Martin-Mayor et al.
Deep Learning of Phase Transitions for Bilinear-Biquadratic Spin-1 Chains from Correlation Aspects
Ming-Chiang Chung, Yu-Ting Kuo, Ian McCulloch et al.
Resolving Structural Uncertainty in Stochastic Dynamical Systems via Ensemble-Based Bayesian Inference
Francesco Zambelli, Valeria D'Andrea, Manlio De Domenico
Seismology of Glasses
Zhiyu Cao, Peter G. Wolynes
Orbital cancellation and reentrant localization in a quasiperiodic trimer ladder
Xin Wang, Pei-Jie Chang, Quanfeng Lu et al.
Quantum Localization in Geometric Complex Networks
Jan Lewenstein-Sanpera, Tobias Grass, M. Àngeles Serrano et al.