mlsanityData to 14 Oct 2026

From superposition to sparse codes: interpretable representations in neural networks

arXiv 2503.01824 ↗First posted 3 Mar 2025cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

Understanding how information is represented in neural networks is a fundamental challenge in both neuroscience and artificial intelligence. Despite their nonlinear architectures, recent evidence suggests that neural networks encode features in superposition, meaning that input concepts are linearly overlaid within the network's representations. We present a perspective that explains this phenomenon and provides a foundation for extracting interpretable representations from neural activations. Our theoretical framework consists of three steps: (1) Identifiability theory shows that neural networks trained for classification recover latent features up to a linear transformation. (2) Sparse coding methods can extract disentangled features from these representations by leveraging principles from compressed sensing. (3) Quantitative interpretability metrics provide a means to assess the success of these methods, ensuring that extracted features align with human-interpretable concepts. By bridging insights from theoretical neuroscience, representation learning, and interpretability research, we propose an emerging perspective on understanding neural representations in both artificial and biological systems. Our arguments have implications for neural coding theories, AI transparency, and the broader goal of making deep learning models more interpretable.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 57 of its 142 references that are in the map. First posted on arXiv 3 Mar 2025.

Builds on

57 of 142 references.

References · 57

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  5. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  6. 2013Auto-Encoding Variational Bayescited by 4,053
  7. 2020Shortcut Learning in Deep Neural Networkscited by 1,969
  8. 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,416
  9. 2022Toy Models of Superpositioncited by 971
  10. 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 941
  11. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
  12. 2024Scaling and evaluating sparse autoencoderscited by 553
38 more
  1. 2018Explaining Explanations: An Overview of Interpretability of Machine Learningcited by 508
  2. 2019Variational Autoencoders and Nonlinear ICA: A Unifying Frameworkcited by 503
  3. 2024The Platonic Representation Hypothesiscited by 382
  4. 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 300
  5. 2018Towards a Definition of Disentangled Representationscited by 296
  6. 2018Nonlinear ICA Using Auxiliary Variables and Generalized Contrastive Learningcited by 282
  7. 2016Unsupervised Feature Extraction by Time-Contrastive Learning and Nonlinear ICAcited by 273
  8. 2021Contrastive Learning Inverts the Data Generating Processcited by 221
  9. 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 179
  10. 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
  11. 2024The Geometry of Categorical and Hierarchical Concepts in Large Language Modelscited by 159
  12. 2020Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse Codingcited by 122
  13. 2021Transformer visualization via dictionary learning: contextualized embedding as a linear superposition of transformer factorscited by 108
  14. 2023How do Language Models Bind Entities in Context?cited by 108
  15. 2020ICE-BeeM: Identifiable Conditional Energy-Based Deep Models Based on Nonlinear ICAcited by 102
  16. 2025Sparse Autoencoders Trained on the Same Data Learn Different Featurescited by 93
  17. 2020On Interpretability of Artificial Neural Networks: A Surveycited by 88
  18. 2024Sparse autoencoders reveal selective remapping of visual concepts during adaptationcited by 68
  19. 2024InterPLM: Discovering Interpretable Features in Protein Language Models via Sparse Autoencoderscited by 66
  20. 2025Universal Sparse Autoencoders: Interpretable Cross-Model Concept Alignmentcited by 62
  21. 2023Identifiability of latent-variable and structural-equation models: from linear to nonlinearcited by 58
  22. 2017SPINE: SParse Interpretable Neural Embeddingscited by 55
  23. 2020Towards falsifiable interpretability researchcited by 53
  24. 2015Sparse Overcomplete Word Vector Representationscited by 44
  25. 2022Synergies between Disentanglement and Sparsity: Generalization and Identifiability in Multi-Task Learningcited by 44
  26. 2024Monitoring Latent World States in Language Models with Propositional Probescited by 43
  27. 2024InfoNCE: Identifying the Gap Between Theory and Practicecited by 40
  28. 2019Learning From Brains How to Regularize Machinescited by 38
  29. 2024A Sparsity Principle for Partially Observable Causal Representation Learningcited by 35
  30. 2023Generalizing Nonlinear ICA Beyond Structural Sparsitycited by 34
  31. 2024Cross-Entropy Is All You Need To Invert the Data Generating Processcited by 31
  32. 2020Disentangling by Subspace Diffusioncited by 28
  33. 2024Quantifying Feature Space Universality Across Large Language Models via Sparse Autoencoderscited by 27
  34. 2016HyperLex: A Large-Scale Evaluation of Graded Lexical Entailmentcited by 26
  35. 2017Eigen-Distortions of Hierarchical Representationscited by 26
  36. 2023Interpretability Illusions in the Generalization of Simplified Modelscited by 25
  37. 2020Independent Innovation Analysis for Nonlinear Vector Autoregressive Processcited by 19
  38. 2024Compute Optimal Inference and Provable Amortisation Gap in Sparse Autoencoderscited by 18

50 most cited of 57 All 57 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 11.

16 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2026Complete or Sparse: A Tale of Two Identifiabilities
  2. 2026Feature Superposition in Neural Networks: From Theory to Practice
  3. 2025A Unified Theory of Sparse Dictionary Learning in Mechanistic Interpretability: Piecewise Biconvexity and Spurious Minima
  4. 2026Sparse Transformer: a Controlled Testbed for Mechanistic Interpretability
  5. 2024Interpretability as Compression: Reconsidering SAE Explanations of Neural Activations with MDL-SAEs
  6. 2026Compressed Computation under L4 Loss is likely Computation in Superposition
  7. 2024Choosing the right basis for interpretability: Psychophysical comparison between neuron-based and dictionary-based representations
  8. 2026Mechanistic Interpretability for Neural Networks: Circuits, Sparse Features and Symbolic Reasoning