mlsanityData to 14 Oct 2026

Superposition as Lossy Compression: Measure with Sparse Autoencoders and Connect to Adversarial Vulnerability

arXiv 2512.13568 ↗First posted 15 Dec 2025cs.LG cs.AIcited by 7

On the map: Mechanistic interpretability → Sparse autoencoder training and evaluation

Abstract (arXiv)

Neural networks achieve remarkable performance through superposition: encoding multiple features as overlapping directions in activation space rather than dedicating individual neurons to each feature. This challenges interpretability, yet we lack principled methods to measure superposition. We present an information-theoretic framework measuring a neural representation's effective degrees of freedom. We apply Shannon entropy to sparse autoencoder activations to compute the number of effective features as the minimum neurons needed for interference-free encoding. Equivalently, this measures how many "virtual neurons" the network simulates through superposition. When networks encode more effective features than actual neurons, they must accept interference as the price of compression. Our metric strongly correlates with ground truth in toy models, detects minimal superposition in algorithmic tasks, and reveals systematic reduction under dropout. Layer-wise patterns mirror intrinsic dimensionality studies on Pythia-70M. The metric also captures developmental dynamics, detecting sharp feature consolidation during grokking. Surprisingly, adversarial training can increase effective features while improving robustness, contradicting the hypothesis that superposition causes vulnerability. Instead, the effect depends on task complexity and network capacity: simple tasks with ample capacity allow feature expansion (abundance regime), while complex tasks or limited capacity force reduction (scarcity regime). By defining superposition as lossy compression, this work enables principled measurement of how neural networks organize information under computational constraints, connecting superposition to adversarial robustness.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Placed in Sparse autoencoder training and evaluation, one of 13 directions in Mechanistic interpretability. Builds on 41 of its 64 references that are in the map. First posted on arXiv 15 Dec 2025.

Builds on

41 of 64 references.

Closest ancestors · 6

Same direction, newest first

  1. 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoders21 Mar
  2. 2024Interpretability as Compression: Reconsidering SAE Explanations of Neural Activations with MDL-SAEs15 Oct
  3. 2024Mathematical Models of Computation in Superposition10 Aug
  4. 2024Interpreting Attention Layer Outputs with Sparse Autoencoders25 Jun
  5. 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learning17 May
  6. 2022Toy Models of Superposition21 Sep

Other references · 35

  1. 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
  4. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  5. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
  6. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  7. 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
  8. 2018Robustness May Be at Odds with Accuracycited by 880
  9. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  10. 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 716
  11. 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
  12. 2024Scaling and evaluating sparse autoencoderscited by 553
23 more
  1. 2016Delving into Transferable Adversarial Examples and Black-box Attackscited by 536
  2. 2017Opening the Black Box of Deep Neural Networks via Informationcited by 503
  3. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 435
  4. 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 422
  5. 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 316
  6. 2019Intrinsic dimension of data representations in deep neural networkscited by 282
  7. 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
  8. 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 179
  9. 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 160
  10. 2023The Quantization Model of Neural Scalingcited by 138
  11. 2024BatchTopK Sparse Autoencoderscited by 130
  12. 2022Toward Transparent AI: A Survey on Interpreting the Inner Structures of Deep Neural Networkscited by 129
  13. 2024Automatically Interpreting Millions of Features in Large Language Modelscited by 113
  14. 2023Tracr: Compiled Transformers as a Laboratory for Interpretabilitycited by 104
  15. 2019On the Connection Between Adversarial Robustness and Saliency Map Interpretabilitycited by 80
  16. 2022Polysemanticity and Capacity in Neural Networkscited by 77
  17. 2020Adversarial Robustness on In- and Out-Distribution Improves Explainabilitycited by 73
  18. 2020Measuring Disentanglement: A Review of Metricscited by 70
  19. 2020Proper Network Interpretability Helps Adversarial Robustness in Classificationcited by 41
  20. 2022Interpreting Neural Networks through the Polytope Lenscited by 33
  21. 2024Understanding polysemanticity in neural networks through coding theorycited by 17
  22. 2020Second Order Optimization for Adversarial Robustness and Interpretabilitycited by 7
  23. 2023Relationship between Model Compression and Adversarial Robustness: A Review of Current Evidencecited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 7.

7 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Compressed Computation under L4 Loss is likely Computation in Superposition
  2. 2026Compressed Computation is (probably) not Computation in Superposition
  3. 2025From superposition to sparse codes: interpretable representations in neural networks
  4. 2026Similarity of Neural Network Representations in Superposition
  5. 2026Effects of sparsity and superposition on loss in simple autoencoders
  6. 2026From Geometric Recovery to Causal Validation: A Reproducible Audit of Sparse Autoencoder Features, from Superposition Geometry to Causal Inertness
  7. 2026Superposition unifies power-law training dynamics
  8. 2025Superposition Yields Robust Neural Scaling