Cross-Entropy Is All You Need To Invert the Data Generating Process
Not on the map. Why?
Abstract (arXiv)
Supervised learning has become a cornerstone of modern machine learning, yet a comprehensive theory explaining its effectiveness remains elusive. Empirical phenomena, such as neural analogy-making and the linear representation hypothesis, suggest that supervised models can learn interpretable factors of variation in a linear fashion. Recent advances in self-supervised learning, particularly nonlinear Independent Component Analysis, have shown that these methods can recover latent structures by inverting the data generating process. We extend these identifiability results to parametric instance discrimination, then show how insights transfer to the ubiquitous setting of supervised learning with cross-entropy minimization. We prove that even in standard classification tasks, models learn representations of ground-truth factors of variation up to a linear transformation. We corroborate our theoretical contribution with a series of empirical studies. First, using simulated data matching our theoretical assumptions, we demonstrate successful disentanglement of latent factors. Second, we show that on DisLib, a widely-used disentanglement benchmark, simple classification tasks recover latent structures up to linear transformations. Finally, we reveal that models trained on ImageNet encode representations that permit linear decoding of proxy factors of variation. Together, our theoretical findings and experiments offer a compelling explanation for recent observations of linear representations, such as superposition in neural networks. This work takes a significant step toward a cohesive theory that accounts for the unreasonable effectiveness of supervised deep learning.
Key facts. Cited by 31 papers in the map (data through 14 Oct 2026). Builds on 47 of its 73 references that are in the map. First posted on arXiv 29 Oct 2024.
Builds on
47 of 73 references.
References · 47
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2020Shortcut Learning in Deep Neural Networkscited by 1,969
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,845
- 2018ImageNet-trained CNNs are biased towards texture; increasing shape bias improves accuracy and robustnesscited by 1,432
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
- 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 424
- 2024The Platonic Representation Hypothesiscited by 382
35 more
- 2021Understanding Dimensional Collapse in Contrastive Self-supervised Learningcited by 378
- 2014Discriminative Unsupervised Feature Learning with Exemplar Convolutional Neural Networkscited by 300
- 2018Towards a Definition of Disentangled Representationscited by 296
- 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 282
- 2016Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICAcited by 273
- 2020Weakly-Supervised Disentanglement Without Compromisescited by 239
- 2021Contrastive Learning Inverts the Data Generating Processcited by 221
- 2024Not All Language Model Features Are One-Dimensionally Linearcited by 212
- 2022Relative representations enable zero-shot latent space communicationcited by 191
- 2017Deep Learning is Robust to Massive Label Noisecited by 165
- 2022Contrastive and Non-Contrastive Self-Supervised Learning Recover Global and Local Spectral Embedding Methodscited by 149
- 2020Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse Codingcited by 122
- 2020On Linear Identifiability of Learned Representationscited by 105
- 2022Chaos is a Ladder: A New Theoretical Understanding of Contrastive Learning via Augmentation Overlapcited by 105
- 2019The Incomplete Rosetta Stone Problem: Identifiability Results for Multi-View Nonlinear ICAcited by 86
- 2019Analogies Explained: Towards Understanding Word Embeddingscited by 64
- 2021Disentangling Identifiable Features from Noisy Data with Structured Nonlinear ICAcited by 64
- 2023Identifiability of latent-variable and structural-equation models: from linear to nonlinearcited by 58
- 2022Beyond Separability: Analyzing the Linear Transferability of Contrastive Representations to Related Subpopulationscited by 44
- 2022ImageNet-X: Understanding Model Mistakes with Factor of Variation Annotationscited by 44
- 2022Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learningcited by 44
- 2024InfoNCE: Identifying the Gap Between Theory and Practicecited by 40
- 2022Disentanglement of Correlated Factors via Hausdorff Factorized Supportcited by 37
- 2023On the Stepwise Nature of Self-Supervised Learningcited by 36
- 2023Leveraging sparse and shared feature activations for disentangled representation learningcited by 32
- 2020Disentangling by Subspace Diffusioncited by 28
- 2022Guillotine Regularization: Why removing layers is needed to improve generalization in Self-Supervised Learningcited by 26
- 2020Independent Innovation Analysis for Nonlinear Vector Autoregressive Processcited by 19
- 2022A Non-isotropic Probabilistic Take on Proxy-based Deep Metric Learningcited by 19
- 2021Addressing the Topological Defects of Disentanglement via Distributed Operatorscited by 14
- 2022Towards efficient representation identification in supervised learningcited by 14
- 2023Identifiable Contrastive Learning with Automatic Feature Importance Discoverycited by 14
- 2019Analytical Methods for Interpretable Ultradense Word Embeddingscited by 13
- 2024Occam's Razor for Self Supervised Learning: What is Sufficient to Learn Good Representations?cited by 8
- 2020Causal Inference from Slowly Varying Nonstationary Processescited by 5
Built on by
Citing papers per year: 2025: 16; 2026: 15.
31 papers.
Sort:
By area:
- 2025The Origins of Representation Manifolds in Large Language Modelscited by 51
- 2026When Does LeJEPA Learn a World Model?cited by 30
- 2026There Will Be a Scientific Theory of Deep Learningcited by 29
- 2025From superposition to sparse codes: interpretable representations in neural networkscited by 16
- 2026InfoNCE Induces Gaussian Distributioncited by 16
- 2025Learning Interactive World Model for Object-Centric Reinforcement Learningcited by 11
- 2025Position: An Empirically Grounded Identifiability Theory Will Accelerate Self-Supervised Learning Researchcited by 9
- 2026Statistical and structural identifiability in representation learningcited by 6
- 2026Stop Probing, Start Coding: Why Linear Probes and Sparse Autoencoders Fail at Compositional Generalisationcited by 6
- 2025Connecting Neural Models Latent Geometries with Relative Geodesic Representationscited by 4
- 2025When Does Closeness in Distribution Imply Representational Similarity? An Identifiability Perspectivecited by 4
- 2025Skill Learning via Policy Diversity Yields Identifiable Representations for Reinforcement Learningcited by 4
19 more
- 2025CausalVerse: Benchmarking Causal Representation Learning with Configurable High-Fidelity Simulationscited by 4
- 2026Understanding Self-Supervised Learning via Latent Distribution Matchingcited by 4
- 2025DIET-CP: Lightweight and Data Efficient Self Supervised Continued Pretrainingcited by 3
- 2025Nonparametric Identification of Latent Conceptscited by 3
- 2026The Universal Normal Embeddingcited by 3
- 2026A Unifying Framework for Unsupervised Concept Extractioncited by 1
- 2026SCAR: Self-Supervised Continuous Action Representation Learningcited by 1
- 2025Is Supervised Learning Really That Different from Unsupervised?cited by 0
- 2025Estimating Treatment Effects with Independent Component Analysiscited by 0
- 2025The Anti-Ouroboros Effect: Emergent Resilience in Large Language Models from Recursive Selective Feedbackcited by 0
- 2025Why all roads don't lead to Rome: Representation geometry varies across the human visual cortical hierarchycited by 0
- 2025Eigenfunction Extraction for Ordered Representation Learningcited by 0
- 2025Beyond the Black Box: Identifiable Interpretation and Control in Generative Models via Causal Minimalitycited by 0
- 2026Logit Distance Bounds Representational Similaritycited by 0
- 2026Similarity of Neural Network Representations in Superpositioncited by 0
- 2026A Dialogue between Causal and Traditional Representation Learning: Toward Mutual Benefits in a Unified Formulationcited by 0
- 2026Expressivity In Multimodal Contrastive Learningcited by 0
- 2026A Survey on the Linear Representation Hypothesiscited by 0
- 2026Beyond Task Success: A Theory of Representation Reusecited by 0
- 2026Beyond Task Success: A Theory of Representation Reuse13 Oct 2026
- 2026A Survey on the Linear Representation Hypothesis19 Sep 2026
- 2026Expressivity In Multimodal Contrastive Learning17 Aug 2026
- 2026When Does LeJEPA Learn a World Model?25 May 2026
- 2026A Dialogue between Causal and Traditional Representation Learning: Toward Mutual Benefits in a Unified Formulation20 May 2026
- 2026SCAR: Self-Supervised Continuous Action Representation Learning13 May 2026
- 2026Understanding Self-Supervised Learning via Latent Distribution Matching5 May 2026
- 2026A Unifying Framework for Unsupervised Concept Extraction27 Apr 2026
- 2026There Will Be a Scientific Theory of Deep Learning23 Apr 2026
- 2026Similarity of Neural Network Representations in Superposition31 Mar 2026
- 2026Stop Probing, Start Coding: Why Linear Probes and Sparse Autoencoders Fail at Compositional Generalisation30 Mar 2026
- 2026The Universal Normal Embedding23 Mar 2026
19 more
- 2026Statistical and structural identifiability in representation learning12 Mar 2026
- 2026InfoNCE Induces Gaussian Distribution27 Feb 2026
- 2026Logit Distance Bounds Representational Similarity17 Feb 2026
- 2025Beyond the Black Box: Identifiable Interpretation and Control in Generative Models via Causal Minimality11 Dec 2025
- 2025Learning Interactive World Model for Object-Centric Reinforcement Learning4 Nov 2025
- 2025Eigenfunction Extraction for Ordered Representation Learning28 Oct 2025
- 2025CausalVerse: Benchmarking Causal Representation Learning with Configurable High-Fidelity Simulations15 Oct 2025
- 2025Nonparametric Identification of Latent Concepts30 Sep 2025
- 2025Why all roads don't lead to Rome: Representation geometry varies across the human visual cortical hierarchy16 Sep 2025
- 2025The Anti-Ouroboros Effect: Emergent Resilience in Large Language Models from Recursive Selective Feedback2 Sep 2025
- 2025DIET-CP: Lightweight and Data Efficient Self Supervised Continued Pretraining2 Sep 2025
- 2025Estimating Treatment Effects with Independent Component Analysis22 Jul 2025
- 2025Skill Learning via Policy Diversity Yields Identifiable Representations for Reinforcement Learning19 Jul 2025
- 2025When Does Closeness in Distribution Imply Representational Similarity? An Identifiability Perspective4 Jun 2025
- 2025Connecting Neural Models Latent Geometries with Relative Geodesic Representations2 Jun 2025
- 2025The Origins of Representation Manifolds in Large Language Models23 May 2025
- 2025Is Supervised Learning Really That Different from Unsupervised?16 May 2025
- 2025Position: An Empirically Grounded Identifiability Theory Will Accelerate Self-Supervised Learning Research17 Apr 2025
- 2025From superposition to sparse codes: interpretable representations in neural networks3 Mar 2025
- 2025The Origins of Representation Manifolds in Large Language Modelscited by 51
- 2026Stop Probing, Start Coding: Why Linear Probes and Sparse Autoencoders Fail at Compositional Generalisationcited by 6
- 2026A Unifying Framework for Unsupervised Concept Extractioncited by 1
- 2026Similarity of Neural Network Representations in Superpositioncited by 0
- 2026A Unifying Framework for Unsupervised Concept Extraction27 Apr 2026
- 2026Similarity of Neural Network Representations in Superposition31 Mar 2026
- 2026Stop Probing, Start Coding: Why Linear Probes and Sparse Autoencoders Fail at Compositional Generalisation30 Mar 2026
- 2025The Origins of Representation Manifolds in Large Language Models23 May 2025
- 2026When Does LeJEPA Learn a World Model?cited by 30
- 2025Learning Interactive World Model for Object-Centric Reinforcement Learningcited by 11
- 2026SCAR: Self-Supervised Continuous Action Representation Learningcited by 1
- 2026When Does LeJEPA Learn a World Model?25 May 2026
- 2026SCAR: Self-Supervised Continuous Action Representation Learning13 May 2026
- 2025Learning Interactive World Model for Object-Centric Reinforcement Learning4 Nov 2025
- 2026The Universal Normal Embeddingcited by 3
- 2026The Universal Normal Embedding23 Mar 2026
- 2026Logit Distance Bounds Representational Similaritycited by 0
- 2026Logit Distance Bounds Representational Similarity17 Feb 2026
- 2026Expressivity In Multimodal Contrastive Learningcited by 0
- 2026Expressivity In Multimodal Contrastive Learning17 Aug 2026
- 2026There Will Be a Scientific Theory of Deep Learningcited by 29
- 2025From superposition to sparse codes: interpretable representations in neural networkscited by 16
- 2026InfoNCE Induces Gaussian Distributioncited by 16
- 2025Position: An Empirically Grounded Identifiability Theory Will Accelerate Self-Supervised Learning Researchcited by 9
- 2026Statistical and structural identifiability in representation learningcited by 6
- 2025Connecting Neural Models Latent Geometries with Relative Geodesic Representationscited by 4
- 2025When Does Closeness in Distribution Imply Representational Similarity? An Identifiability Perspectivecited by 4
- 2025CausalVerse: Benchmarking Causal Representation Learning with Configurable High-Fidelity Simulationscited by 4
- 2026Understanding Self-Supervised Learning via Latent Distribution Matchingcited by 4
- 2025DIET-CP: Lightweight and Data Efficient Self Supervised Continued Pretrainingcited by 3
- 2025Nonparametric Identification of Latent Conceptscited by 3
- 2025Is Supervised Learning Really That Different from Unsupervised?cited by 0
12 most cited of 20 All 20 (JSON)
- 2026Beyond Task Success: A Theory of Representation Reuse13 Oct 2026
- 2026A Survey on the Linear Representation Hypothesis19 Sep 2026
- 2026A Dialogue between Causal and Traditional Representation Learning: Toward Mutual Benefits in a Unified Formulation20 May 2026
- 2026Understanding Self-Supervised Learning via Latent Distribution Matching5 May 2026
- 2026There Will Be a Scientific Theory of Deep Learning23 Apr 2026
- 2026Statistical and structural identifiability in representation learning12 Mar 2026
- 2026InfoNCE Induces Gaussian Distribution27 Feb 2026
- 2025Beyond the Black Box: Identifiable Interpretation and Control in Generative Models via Causal Minimality11 Dec 2025
- 2025Eigenfunction Extraction for Ordered Representation Learning28 Oct 2025
- 2025CausalVerse: Benchmarking Causal Representation Learning with Configurable High-Fidelity Simulations15 Oct 2025
- 2025Nonparametric Identification of Latent Concepts30 Sep 2025
- 2025Why all roads don't lead to Rome: Representation geometry varies across the human visual cortical hierarchy16 Sep 2025
12 newest of 20 All 20 (JSON)
Similar, not cited
Close in wording, no citation either way
- 2026Complete or Sparse: A Tale of Two Identifiabilities
- 2024Exploring Information-Theoretic Metrics Associated with Neural Collapse in Supervised Training
- 2022Self-Supervised Learning via Maximum Entropy Coding
- 2026Evaluating the Representation Space of Diffusion Models via Self-Supervised Principles
- 2024Diffusion Model with Cross Attention as an Inductive Bias for Disentanglement
- 2023On the Identifiability of Quantized Factors
- 2024Disentangling Disentangled Representations: Towards Improved Latent Units via Diffusion Models
- 2022Measuring the Interpretability of Unsupervised Representations via Quantized Reverse Probing