Deep Networks from the Principle of Rate Reduction
Not on the map. Why?
Abstract (arXiv)
This work attempts to interpret modern deep (convolutional) networks from the principles of rate reduction and (shift) invariant classification. We show that the basic iterative gradient ascent scheme for optimizing the rate reduction of learned features naturally leads to a multi-layer deep network, one iteration per layer. The layered architectures, linear and nonlinear operators, and even parameters of the network are all explicitly constructed layer-by-layer in a forward propagation fashion by emulating the gradient scheme. All components of this "white box" network have precise optimization, statistical, and geometric interpretation. This principled framework also reveals and justifies the role of multi-channel lifting and sparse coding in early stage of deep networks. Moreover, all linear operators of the so-derived network naturally become multi-channel convolutions when we enforce classification to be rigorously shift-invariant. The derivation also indicates that such a convolutional network is significantly more efficient to construct and learn in the spectral domain. Our preliminary simulations and experiments indicate that so constructed deep network can already learn a good discriminative representation even without any back propagation training.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 4; 2023: 1; 2024: 2.
10 papers.
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 226
- 2022Neural Collapse: A Review on Modelling Principles and Generalizationcited by 95
- 2021Recent Advances of Continual Learning in Computer Vision: An Overviewcited by 55
- 2022Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifoldcited by 50
- 2023Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Modelscited by 22
- 2024Guiding Neural Collapse: Optimising Towards the Nearest Simplex Equiangular Tight Framecited by 14
- 2021Understanding Neural Networks with Logarithm Determinant Entropy Estimatorcited by 10
- 2022Neural Networks as Paths through the Space of Representationscited by 5
- 2024White-Box Diffusion Transformer for single-cell RNA-seq generationcited by 1
- 2022Sample-efficient Quantum Born Machine through Coding Rate Reductioncited by 0
- 2024White-Box Diffusion Transformer for single-cell RNA-seq generation11 Nov 2024
- 2024Guiding Neural Collapse: Optimising Towards the Nearest Simplex Equiangular Tight Frame2 Nov 2024
- 2023Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Models8 Jun 2023
- 2022Sample-efficient Quantum Born Machine through Coding Rate Reduction14 Nov 2022
- 2022Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifold19 Sep 2022
- 2022Neural Networks as Paths through the Space of Representations22 Jun 2022
- 2022Neural Collapse: A Review on Modelling Principles and Generalization8 Jun 2022
- 2021Recent Advances of Continual Learning in Computer Vision: An Overview23 Sep 2021
- 2021Understanding Neural Networks with Logarithm Determinant Entropy Estimator8 May 2021
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Features6 May 2021