Rank Diminishing in Deep Neural Networks

Ruili Feng, Kecheng Zheng, Yukun Huang, Deli Zhao, Michael I. Jordan, Zheng-Jun Zha

Abstract

Deep neural networks (DNNs) are often characterized by their ability to learn high-dimensional representations. However, this study reveals a counter-intuitive phenomenon: the rank of these representations—a proxy for information flow—diminishes monotonically and often exponentially as depth increases. We provide a theoretical proof for this "Principle of Rank Diminishing" and introduce computationally efficient tools to measure it across modern architectures. Our empirical findings on ImageNet-trained models demonstrate that this decay is universal, leading to a significant "independence deficit" where class predictions become highly redundant due to the low intrinsic dimensionality of the final feature space.

Introduction

While the success of deep learning is well-documented, the internal mechanics of how information is transformed across layers remain partially opaque. A key aspect of this transformation is the rank of the feature representations and the Jacobian matrices of the network's layers. Low-rank representations are often desirable for generalization, but an excessive loss of rank can lead to information bottlenecks. This paper investigates the layer-by-layer evolution of rank, providing both a rigorous theoretical framework and practical numerical metrics to quantify "rank diminishing" in state-of-the-art networks.

Theoretical Foundation and Numerical Metrics

The authors establish the Principle of Rank Diminishing, proving that the rank of a network's output relative to its input must decrease as it passes through successive layers. This is a direct consequence of the chain rule and the properties of matrix multiplication.

To measure this phenomenon in practice, the study introduces several innovations:

  1. Numerical Rank: A noise-robust metric that counts singular values exceeding a threshold relative to the spectral norm.
  2. Partial Jacobian Rank: A memory-efficient method to compute the rank of sub-matrices (e.g., from input patches), bypassing the massive VRAM requirements of full Jacobian matrices for deep networks like ResNet-50.
  3. Classification Dimension (ClsDim): A metric that estimates the intrinsic dimension of the final feature space by determining the minimum number of principal components needed to maintain classification performance.

Universal Rank Decay Across Architectures

Empirical validation on ImageNet shows that rank diminishing is a universal property of modern DNNs, including CNNs (ResNets), MLP-Mixers, and Transformers (ViT, Swin). Regardless of the specific architecture or initialization scheme, the rank of feature representations consistently drops as data moves deeper into the network.

Rank histograms for various architectures (a-c) and initialization schemes in toy MLPs (d-f), showing consistent rank diminishing with depth.

The decay is often exponential. Interestingly, while standard layers like convolutions and fully connected layers contribute significantly to rank loss, normalization layers (such as BatchNorm and LayerNorm) appear to mitigate this effect, losing rank much more modestly.

The Independence Deficit

A striking consequence of rank diminishing is the Independence Deficit. Because the final feature space has a much lower intrinsic dimension than its ambient dimension (e.g., an intrinsic dimension of 131 for ResNet-50's 2048-unit space), different categories end up sharing representations.

Using Lasso regression, the authors demonstrate that a network's confidence in one category can often be linearly predicted from its confidence in a few others. For example, in a trained ResNet-50, the logit for "hamster" can be predicted with 98% accuracy using a linear combination of five other, often semantically unrelated, categories. This suggests that current training paradigms may induce non-realistic dependencies between classes.

Conclusion

Rank diminishing is an inherent impetus in deep neural networks, driven by both explicit architectural choices and implicit mathematical properties of coupled functions. While some rank loss is expected as networks extract high-level features, the extreme redundancy observed in the "independence deficit" highlights potential vulnerabilities and opportunities for architectural improvement. Future research into rank-preserving designs could lead to models with better generalization and more robust internal representations.

Summary updated

Abstract

The rank of neural networks measures information flowing across layers. It is an instance of a key structural condition that applies across broad domains of machine learning. In particular, the assumption of low-rank feature representations led to algorithmic developments in many architectures. For neural networks, however, the intrinsic mechanism that yields low-rank structures remains vague and unclear. To fill this gap, we perform a rigorous study on the behavior of network rank, focusing particularly on the notion of rank deficiency. We theoretically establish a universal monotone decreasing property of network ranks from the basic rules of differential and algebraic composition, and uncover rank deficiency of network blocks and deep function coupling. By virtue of our numerical tools, we provide the first empirical analysis of the per-layer behavior of network ranks in realistic settings, \ieno, ResNets, deep MLPs, and Transformers on ImageNet. These empirical results are in direct accord with our theory. Furthermore, we reveal a novel phenomenon of independence deficit caused by the rank deficiency of deep networks, where classification confidence of a given category can be linearly decided by the confidence of a handful of other categories. The theoretical results of this work, together with the empirical findings, may advance understanding of the inherent principles of deep neural networks. Code to detect the rank behavior of networks can be found in https://github.com/RuiLiFeng/Rank-Diminishing-in-Deep-Neural-Networks.
BibTeX
@inproceedings{feng2022rank,
  author = {Ruili Feng and Kecheng Zheng and Yukun Huang and Deli Zhao and Michael I. Jordan and Zheng-Jun Zha},
  title = {{Rank Diminishing in Deep Neural Networks}},
  booktitle = {Advances in Neural Information Processing Systems},
  year = {2022},
  url = {https://openreview.net/forum?id=XEjhvj7j1u},
}
Figure