Efficient Maximal Coding Rate Reduction by Variational Forms
Not on the map. Why?
Abstract (arXiv)
The principle of Maximal Coding Rate Reduction (MCR2) has recently been proposed as a training objective for learning discriminative low-dimensional structures intrinsic to high-dimensional data to allow for more robust training than standard approaches, such as cross-entropy minimization. However, despite the advantages that have been shown for MCR2 training, MCR2 suffers from a significant computational cost due to the need to evaluate and differentiate a significant number of log-determinant terms that grows linearly with the number of classes. By taking advantage of variational forms of spectral functions of a matrix, we reformulate the MCR2 objective to a form that can scale significantly without compromising training accuracy. Experiments in image classification demonstrate that our proposed formulation results in a significant speed up over optimizing the original MCR2 objective directly and often results in higher quality learned representations. Further, our approach may be of independent interest in other models that require computation of log-determinant forms, such as in system identification or normalizing flow models.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 9 of its 27 references that are in the map. First posted on arXiv 31 Mar 2022.
Builds on
9 of 27 references.
References · 9
- 2020Shortcut Learning in Deep Neural Networkscited by 1,928
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
- 2020The Pitfalls of Simplicity Bias in Neural Networkscited by 349
- 2020Towards Understanding Ensemble, Knowledge Distillation and Self-Distillation in Deep Learningcited by 292
- 2020Regularizing Class-wise Predictions via Self-knowledge Distillationcited by 144
- 2020Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reductioncited by 141
- 2022Limitations of Neural Collapse for Understanding Generalization in Deep Learningcited by 63
- 2021Which Shortcut Cues Will DNNs Choose? A Study from the Parameter-Space Perspectivecited by 56
- 2018Bilinear Parameterization For Differentiable Rank-Regularizationcited by 2
Built on by
Citing papers per year: 2022: 1; 2023: 4; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2022On the Principles of Parsimony and Self-Consistency for the Emergence of Intelligencecited by 50
- 2023Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Modelscited by 22
- 2023Unsupervised Manifold Linearizing and Clusteringcited by 12
- 2023On Interpretable Approaches to Cluster, Classify and Represent Multi-Subspace Data via Minimum Lossy Coding Length based on Rate-Distortion Theorycited by 0
- 2023Justices for Information Bottleneck Theorycited by 0
- 2026On the Limits of Maximal Coding Rate Reduction for Out-of-Distribution Generalisationcited by 0
- 2026On the Limits of Maximal Coding Rate Reduction for Out-of-Distribution Generalisation17 Sep 2026
- 2023Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Models8 Jun 2023
- 2023Justices for Information Bottleneck Theory19 May 2023
- 2023On Interpretable Approaches to Cluster, Classify and Represent Multi-Subspace Data via Minimum Lossy Coding Length based on Rate-Distortion Theory21 Feb 2023
- 2023Unsupervised Manifold Linearizing and Clustering4 Jan 2023
- 2022On the Principles of Parsimony and Self-Consistency for the Emergence of Intelligence11 Jul 2022