Formation of Representations in Neural Networks
Not on the map. Why?
Abstract (arXiv)
Understanding neural representations will help open the black box of neural networks and advance our scientific understanding of modern AI systems. However, how complex, structured, and transferable representations emerge in modern neural networks has remained a mystery. Building on previous results, we propose the Canonical Representation Hypothesis (CRH), which posits a set of six alignment relations to universally govern the formation of representations in most hidden layers of a neural network. Under the CRH, the latent representations (R), weights (W), and neuron gradients (G) become mutually aligned during training. This alignment implies that neural networks naturally learn compact representations, where neurons and weights are invariant to task-irrelevant transformations. We then show that the breaking of CRH leads to the emergence of reciprocal power-law relations between R, W, and G, which we refer to as the Polynomial Alignment Hypothesis (PAH). We present a minimal-assumption theory proving that the balance between gradient noise and regularization is crucial for the emergence of the canonical representation. The CRH and PAH lead to an exciting possibility of unifying major key deep learning phenomena, including neural collapse and the neural feature ansatz, in a single framework.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 26 of its 51 references that are in the map. First posted on arXiv 3 Oct 2024.
Builds on
26 of 51 references.
References · 26
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,733
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2013Visualizing and Understanding Convolutional Networkscited by 2,290
- 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
- 2024The Platonic Representation Hypothesiscited by 382
- 2021Explaining Neural Scaling Lawscited by 363
- 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 230
- 2021Contrastive Learning Inverts the Data Generating Processcited by 221
- 2020Feature Learning in Infinite-Width Neural Networkscited by 190
- 2020On Linear Identifiability of Learned Representationscited by 105
- 2021On the Role of Neural Collapse in Transfer Learningcited by 100
14 more
- 2022Neural Collapse: A Review on Modelling Principles and Generalizationcited by 95
- 2021An Unconstrained Layer-Peeled Perspective on Neural Collapsecited by 87
- 2024Scaling Exponents Across Parameterizations and Optimizerscited by 76
- 2018Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representationcited by 62
- 2019Universality and individuality in neural dynamics across large populations of recurrent networkscited by 61
- 2020A Disentangling Invertible Interpretation Network for Explaining Latent Representationscited by 57
- 2018Fluctuation-dissipation relations for stochastic gradient descentcited by 48
- 2020Noise and Fluctuation of Finite Learning Rate Stochastic Gradient Descentcited by 37
- 2023The Tunnel Effect: Building Data Representations in Deep Neural Networkscited by 34
- 2022Mechanism of feature learning in deep fully connected networks and kernel machines that recursively learn featurescited by 25
- 2023Symmetry Induces Structure and Constraint of Learningcited by 25
- 2024Parameter Symmetry and Noise Equilibrium of Stochastic Gradient Descentcited by 19
- 2023Mechanism of feature learning in convolutional neural networkscited by 17
- 2024When Representations Align: Universality in Representation Learning Dynamicscited by 10
Built on by
Citing papers per year: 2024: 1; 2025: 7; 2026: 2.
10 papers.
- 2026There Will Be a Scientific Theory of Deep Learningcited by 29
- 2025Parameter Symmetry Potentially Unifies Deep Learning Theorycited by 12
- 2025Evaluating Adversarial Robustness of Concept Representations in Sparse Autoencoderscited by 12
- 2025Proof of a perfect platonic representation hypothesiscited by 8
- 2025The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representationscited by 2
- 2025On the Neural Feature Ansatz for Deep Neural Networkscited by 2
- 2026MoEless: Efficient MoE LLM Serving via Serverless Computingcited by 1
- 2024How Learning Dynamics Drive Adversarially Robust Generalization?cited by 0
- 2025Ubiquity of Emergent Hebbian Dynamics in Regularized Learningcited by 0
- 2025Algorithm Development in Neural Networks: Insights from the Streaming Parity Taskcited by 0
- 2026There Will Be a Scientific Theory of Deep Learning23 Apr 2026
- 2026MoEless: Efficient MoE LLM Serving via Serverless Computing6 Mar 2026
- 2025On the Neural Feature Ansatz for Deep Neural Networks17 Oct 2025
- 2025Algorithm Development in Neural Networks: Insights from the Streaming Parity Task14 Jul 2025
- 2025The Features at Convergence Theorem: a first-principles alternative to the Neural Feature Ansatz for how networks learn representations8 Jul 2025
- 2025Proof of a perfect platonic representation hypothesis1 Jul 2025
- 2025Ubiquity of Emergent Hebbian Dynamics in Regularized Learning23 May 2025
- 2025Evaluating Adversarial Robustness of Concept Representations in Sparse Autoencoders21 May 2025
- 2025Parameter Symmetry Potentially Unifies Deep Learning Theory7 Feb 2025
- 2024How Learning Dynamics Drive Adversarially Robust Generalization?10 Oct 2024