mlsanityData to 14 Oct 2026

How Optimality Structures Sparse Dictionaries: Theory for Interpreting SAE Representations

arXiv 2606.02385 ↗First posted 1 Jun 2026q-bio.NC cs.LGcited by 0

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

Abstract (arXiv)

Sparse Autoencoders (SAEs) have found success parsing neural network representations into interpretable concepts, providing a basis for understanding and control. However, what exactly SAEs extract and, hence, the scientific conclusions we can draw from them are not obvious. In short, if your SAE behaves strangely, does that reflect interesting neural network behaviour or an SAE-imposed distortion? Towards answering this, we use dictionary learning identifiability results to derive constraints that optimal dictionary learning features must satisfy. For example, an optimal feature will never turn on only while another is active. We use these conditions to explain various SAE oddities - hierarchical splitting & absorption, which features can be left in the residuals, dense antipodal features, and infinite feature splitting - simply as properties imposed by the dictionary learning objective. Finally, these constraints are diagnostic: real SAEs pass when measured on the dataset on which they were trained, but increasingly fail as the test dataset becomes more `distant'. In sum, we hope to provide theoretical tools to explain puzzling SAE patterns, allowing more principled inferences about internal model behaviour.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Sparse autoencoder training and evaluation, one of 13 directions in Mechanistic interpretability. Builds on 27 of its 71 references that are in the map. First posted on arXiv 1 Jun 2026.

Builds on

27 of 71 references.

Closest ancestors · 7

Same direction, newest first

  1. 2025From Flat to Hierarchical: Extracting Sparse Representations with Matching Pursuit3 Jun
  2. 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoders21 Mar
  3. 2025Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometry3 Mar
  4. 2025Archetypal SAE: Adaptive and Stable Dictionary Learning for Concept Extraction in Large Vision Models18 Feb
  5. 2025Sparse Autoencoders Do Not Find Canonical Units of Analysis7 Feb
  6. 2024Compute Optimal Inference and Provable Amortisation Gap in Sparse Autoencoders20 Nov
  7. 2022Toy Models of Superposition21 Sep

Other references · 20

  1. 2021Convex optimizationcited by 2,515
  2. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
  3. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
  4. 2024Scaling and evaluating sparse autoencoderscited by 553
  5. 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 300
  6. 2026Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnetcited by 191
  7. 2016Linear Algebraic Structure of Word Senses, with Applications to Polysemycited by 165
  8. 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 160
  9. 2024BatchTopK Sparse Autoencoderscited by 130
  10. 2025SAEs Are Good for Steering -- If You Select the Right Featurescited by 78
  11. 2022Disentanglement of Correlated Factors via Hausdorff Factorized Supportcited by 37
  12. 2025Dense SAE Latents Are Features, Not Bugscited by 17
8 more
  1. 2022Polytopic Matrix Factorization: Determinant Maximization Based Criterion and Identifiabilitycited by 14
  2. 2025On the Limits of Sparse Autoencoders: A Theoretical Framework and Reweighted Remedycited by 14
  3. 2014Sparse and spurious: dictionary learning with noise and outlierscited by 11
  4. 2015A Hebbian/Anti-Hebbian Network Derived from Online Non-Negative Matrix Factorization Can Cluster and Discover Sparse Featurescited by 10
  5. 2014Local Identification of Overcomplete Dictionariescited by 7
  6. 2018Identifiability of Complete Dictionary Learningcited by 6
  7. 2024Range, not Independence, Drives Modularity in Biologically Inspired Representationscited by 4
  8. 2026Convex Efficient Codingcited by 1

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024Features that Make a Difference: Leveraging Gradients for Improved Dictionary Learning
  2. 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learning
  3. 2026Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?
  4. 2024Efficient Dictionary Learning with Switch Sparse Autoencoders
  5. 2026Verifying the Linear Representation Hypothesis: How Interpretable Are Vision SAEs?
  6. 2026Toward Identifiable Sparse Autoencoders
  7. 2024Towards Principled Evaluations of Sparse Autoencoders for Interpretability and Control
  8. 2025Empirical Evaluation of Progressive Coding for Sparse Autoencoders