Deep Learning Weight Pruning with RMT-SVD: Increasing Accuracy and Reducing Overfitting
Not on the map. Why?
Abstract (arXiv)
In this work, we present some applications of random matrix theory for the training of deep neural networks. Recently, random matrix theory (RMT) has been applied to the overfitting problem in deep learning. Specifically, it has been shown that the spectrum of the weight layers of a deep neural network (DNN) can be studied and understood using techniques from RMT. In this work, these RMT techniques will be used to determine which and how many singular values should be removed from the weight layers of a DNN during training, via singular value decomposition (SVD), so as to reduce overfitting and increase accuracy. We show the results on a simple DNN model trained on MNIST. In general, these techniques may be applied to any fully connected layer of a pretrained DNN to reduce the number of parameters in the layer while preserving and sometimes increasing the accuracy of the DNN.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 13 of its 29 references that are in the map. First posted on arXiv 15 Mar 2023.
Builds on
13 of 29 references.
References · 13
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 211
- 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
- 2017Generalization in Deep Learningcited by 146
- 2020Predicting trends in the quality of state-of-the-art neural networks without access to training or testing datacited by 113
- 2020Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsificationcited by 52
- 2018Trained Rank Pruning for Efficient Deep Neural Networkscited by 23
- 2020Estimation of the number of spiked eigenvalues in a covariance matrix by bulk eigenvalue matching analysiscited by 15
- 2021Impact of classification difficulty on the weight matrices spectra in Deep Learning and application to early-stoppingcited by 12
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.