On Random Matrices Arising in Deep Neural Networks: General I.I.D. Case
Not on the map. Why?
Abstract (arXiv)
We study the distribution of singular values of product of random matrices pertinent to the analysis of deep neural networks. The matrices resemble the product of the sample covariance matrices, however, an important difference is that the population covariance matrices assumed to be non-random or random but independent of the random data matrix in statistics and random matrix theory are now certain functions of random data matrices (synaptic weight matrices in the deep neural network terminology). The problem has been treated in recent work [25, 13] by using the techniques of free probability theory. Since, however, free probability theory deals with population covariance matrices which are independent of the data matrices, its applicability has to be justified. The justification has been given in [22] for Gaussian data matrices with independent entries, a standard analytical model of free probability, by using a version of the techniques of random matrix theory. In this paper we use another, more streamlined, version of the techniques of random matrix theory to generalize the results of [22] to the case where the entries of the synaptic weight matrices are just independent identically distributed random variables with zero mean and finite fourth moment. This, in particular, extends the property of the so-called macroscopic universality on the considered random matrices.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Nov 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 0; 2024: 1; 2025: 2; 2026: 3.
10 papers.
- 2025Towards Quantifying the Hessian Structure of Neural Networkscited by 13
- 2022Concentration of Random Feature Matrices in High-Dimensionscited by 8
- 2024Deep Equilibrium Models are Almost Equivalent to Not-so-deep Explicit Models for High-dimensional Gaussian Mixturescited by 6
- 2022Eigenvalue Distribution of Large Random Matrices Arising in Deep Neural Networks: Orthogonal Casecited by 4
- 2022Universal characteristics of deep neural network loss surfaces from random matrix theorycited by 4
- 2021Free Probability for predicting the performance of feed-forward fully connected neural networkscited by 3
- 2025Random weights of DNNs and emergence of fixed pointscited by 1
- 2026Pruning Deep Neural Networks via the Marchenko--Pastur Distributioncited by 0
- 2026Randomly initialized autoencoders: fixed points and edge-of-chaoscited by 0
- 2026High Probability Derivative Bounds for Random tanh Neural Networks on a Hypercubecited by 0
- 2026High Probability Derivative Bounds for Random tanh Neural Networks on a Hypercube27 Aug 2026
- 2026Randomly initialized autoencoders: fixed points and edge-of-chaos28 Jul 2026
- 2026Pruning Deep Neural Networks via the Marchenko--Pastur Distribution23 May 2026
- 2025Towards Quantifying the Hessian Structure of Neural Networks5 May 2025
- 2025Random weights of DNNs and emergence of fixed points7 Jan 2025
- 2024Deep Equilibrium Models are Almost Equivalent to Not-so-deep Explicit Models for High-dimensional Gaussian Mixtures5 Feb 2024
- 2022Universal characteristics of deep neural network loss surfaces from random matrix theory17 May 2022
- 2022Concentration of Random Feature Matrices in High-Dimensions14 Apr 2022
- 2022Eigenvalue Distribution of Large Random Matrices Arising in Deep Neural Networks: Orthogonal Case12 Jan 2022
- 2021Free Probability for predicting the performance of feed-forward fully connected neural networks1 Nov 2021