On the Limits of Maximal Coding Rate Reduction for Out-of-Distribution Generalisation
Not on the map. Why?
Abstract (arXiv)
Substantial efforts have been devoted to making deep learning objectives, representations, and architectures interpretable, with the goal of improving the safety, robustness, and generalisation of learning systems in diverse real-world applications. The recently proposed maximal coding rate reduction (MCR2) offers a promising information-theoretic framework for learning structured, discriminative representations of class-wise submanifolds and has inspired interpretable white-box architectures. However, we observe that MCR2 can completely fail under distribution shift, motivating our study of its out-of-distribution (OOD) generalisation limits. We establish two limitations of MCR2 for OOD generalisation. First, the MCR2 objective alone can admit complete prediction failure: a representation based entirely on unstable environmental features can achieve the global coding optimum yet fail completely after correlation reversal, despite an available perfectly stable feature. This exact-optimum example includes test inputs that cannot occur during training. Even when every possible test input can also occur during training, coding quality can be arbitrarily close to optimal while prediction error is arbitrarily close to 100%. Second, directly incorporating the invariance principle underlying widely successful invariant risk minimisation (IRM) and risk extrapolation (REx) does not eliminate this failure. The failing representation admits the same optimal coding operator across training environments, showing that shared coding optimality does not ensure stable prediction. Reliable OOD guarantees for MCR2 therefore require additional new assumptions or learning principles that establish stable predictive relationships across environments.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 38 of its 50 references that are in the map. First posted on arXiv 17 Sep 2026.
Builds on
38 of 50 references.
References · 38
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020Shortcut Learning in Deep Neural Networkscited by 1,969
- 2019Invariant Risk Minimizationcited by 1,854
- 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2020In Search of Lost Domain Generalizationcited by 1,054
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2021Domain Generalization: A Surveycited by 764
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 742
- 2016The Mythos of Model Interpretabilitycited by 721
26 more
- 2013Domain Generalization via Invariant Feature Representationcited by 623
- 2015Causal inference using invariant prediction: identification and confidence intervalscited by 536
- 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
- 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
- 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
- 2020Invariant Risk Minimization Gamescited by 188
- 2021A Fine-Grained Analysis on Distribution Shiftcited by 171
- 2020Understanding the Failure Modes of Out-of-Distribution Generalizationcited by 146
- 2020Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reductioncited by 142
- 2018Anchor regression: heterogeneous data meets causalitycited by 118
- 2021Does Invariant Risk Minimization Capture Invariance?cited by 116
- 2021ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reductioncited by 84
- 2022On the Principles of Parsimony and Self-Consistency for the Emergence of Intelligencecited by 50
- 2020Incremental Learning via Rate Reductioncited by 31
- 2023White-Box Transformers via Sparse Rate Reduction: Compression Is All There Is?cited by 23
- 2023Image Clustering via the Principle of Rate Reduction in the Age of Pretrained Modelscited by 22
- 2025Simplifying DINO via Coding Rate Regularizationcited by 21
- 2021Closed-Loop Data Transcription to an LDR via Minimaxing Rate Reductioncited by 17
- 2022Incremental Learning of Structured Memory via Closed-Loop Transcriptioncited by 17
- 2024A Global Geometric Analysis of Maximal Coding Rate Reductioncited by 13
- 2024Scaling White-Box Transformers for Visioncited by 9
- 2022Unsupervised Learning of Structured Representations via Closed-Loop Transcriptioncited by 7
- 2022Efficient Maximal Coding Rate Reduction by Variational Formscited by 6
- 2025Attention-Only Transformers via Unrolled Subspace Denoisingcited by 5
Built on by
Not cited yet.