On the Impact of Stable Ranks in Deep Nets
Not on the map. Why?
Abstract (arXiv)
A recent line of work has established intriguing connections between the generalization/compression properties of a deep neural network (DNN) model and the so-called layer weights' stable ranks. Intuitively, the latter are indicators of the effective number of parameters in the net. In this work, we address some natural questions regarding the space of DNNs conditioned on the layers' stable rank, where we study feed-forward dynamics, initialization, training and expressivity. To this end, we first propose a random DNN model with a new sampling scheme based on stable rank. Then, we show how feed-forward maps are affected by the constraint and how training evolves in the overparametrized regime (via Neural Tangent Kernels). Our results imply that stable ranks appear layerwise essentially as linear factors whose effect accumulates exponentially depthwise. Moreover, we provide empirical analysis suggesting that stable rank initialization alone can lead to convergence speed ups.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 20 of its 32 references that are in the map. First posted on arXiv 5 Oct 2021.
Builds on
20 of 32 references.
References · 20
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2017Spectrally-normalized margin bounds for neural networkscited by 681
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2017Exploring Generalization in Deep Learningcited by 595
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 562
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2018Gaussian Process Behaviour in Wide Deep Neural Networkscited by 314
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
- 2016On the Expressive Power of Deep Neural Networkscited by 302
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
8 more
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
- 2019Scaling Limits of Wide Neural Networks with Weight Sharing: Gaussian Process Behavior, Gradient Independence, and Neural Tangent Kernel Derivationcited by 146
- 2019Finite Depth and Width Corrections to the Neural Tangent Kernelcited by 114
- 2019Generalization Guarantees for Neural Networks via Harnessing the Low-rank Structure of the Jacobiancited by 67
- 2020What Do Neural Networks Learn When Trained With Random Labels?cited by 58
- 2019Emergent properties of the local geometry of neural loss landscapescited by 46
- 2019Stable Rank Normalization for Improved Generalization in Neural Networks and GANscited by 41
- 2020Lossless Compression of Deep Neural Networkscited by 34
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.
- 2025PoLAR: Polar-Decomposed Low-Rank Adapter Representationcited by 19
- 2024Communication-Efficient Federated Low-Rank Update Algorithm and its Connection to Implicit Regularizationcited by 6
- 2025Gradient Descent Robustly Learns the Intrinsic Dimension of Data in Training Convolutional Neural Networkscited by 0
- 2025PoLAR: Polar-Decomposed Low-Rank Adapter Representation3 Jun 2025
- 2025Gradient Descent Robustly Learns the Intrinsic Dimension of Data in Training Convolutional Neural Networks11 Apr 2025
- 2024Communication-Efficient Federated Low-Rank Update Algorithm and its Connection to Implicit Regularization19 Sep 2024