mlsanityData to 14 Oct 2026

Asymptotic Freeness of Layerwise Jacobians Caused by Invariance of Multilayer Perceptron: The Haar Orthogonal Case

arXiv 2103.13466 ↗First posted 24 Mar 2021stat.ML cs.LG math-phcited by 5

Not on the map. Why?

Abstract (arXiv)

Free Probability Theory (FPT) provides rich knowledge for handling mathematical difficulties caused by random matrices that appear in research related to deep neural networks (DNNs), such as the dynamical isometry, Fisher information matrix, and training dynamics. FPT suits these researches because the DNN's parameter-Jacobian and input-Jacobian are polynomials of layerwise Jacobians. However, the critical assumption of asymptotic freenss of the layerwise Jacobian has not been proven completely so far. The asymptotic freeness assumption plays a fundamental role when propagating spectral distributions through the layers. Haar distributed orthogonal matrices are essential for achieving dynamical isometry. In this work, we prove asymptotic freeness of layerwise Jacobians of multilayer perceptron (MLP) in this case. A key of the proof is an invariance of the MLP. Considering the orthogonal matrices that fix the hidden units in each layer, we replace each layer's parameter matrix with itself multiplied by the orthogonal matrix, and then the MLP does not change. Furthermore, if the original weights are Haar orthogonal, the Jacobian is also unchanged by this replacement. Lastly, we can replace each weight with a Haar orthogonal random matrix independent of the Jacobian of the activation function using this key fact.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 17 of its 46 references that are in the map. First posted on arXiv 24 Mar 2021.

Builds on

17 of 46 references.

References · 17

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  2. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 763
  3. 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 217
  4. 2016Deep Information Propagationcited by 195
  5. 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
  6. 2013Revisiting Natural Gradient for Deep Networkscited by 159
  7. 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 149
  8. 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
  9. 2018Universal Statistics of Fisher Information in Deep Neural Networks: Mean Field Approachcited by 91
  10. 2018The Emergence of Spectral Universality in Deep Networkscited by 74
  11. 2018Products of Many Large Random Matrices and Gradients in Deep Neural Networkscited by 49
  12. 2020Tensor Programs III: Neural Matrix Lawscited by 49
5 more
  1. 2019The Normalization Method for Alleviating Pathological Sharpness in Wide Neural Networkscited by 20
  2. 2019Dynamical Isometry and a Mean Field Theory of LSTMs and GRUscited by 17
  3. 2020On Random Matrices Arising in Deep Neural Networks. Gaussian Casecited by 14
  4. 2020The Spectrum of Fisher Information of Deep Networks Achieving Dynamical Isometrycited by 9
  5. 2018Information Geometry of Orthogonal Initializations and Trainingcited by 7

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 3.

5 papers.