Evaluating Sparse Autoencoders: From Shallow Design to Matching Pursuit
Not on the map. Why?
Abstract (arXiv)
Sparse autoencoders (SAEs) have recently become central tools for interpretability, leveraging dictionary learning principles to extract sparse, interpretable features from neural representations whose underlying structure is typically unknown. This paper evaluates SAEs in a controlled setting using MNIST, which reveals that current shallow architectures implicitly rely on a quasi-orthogonality assumption that limits the ability to extract correlated features. To move beyond this, we compare them with an iterative SAE that unrolls Matching Pursuit (MP-SAE), enabling the residual-guided extraction of correlated features that arise in hierarchical settings such as handwritten digit generation while guaranteeing monotonic improvement of the reconstruction as more atoms are selected.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 26 of its 57 references that are in the map. First posted on arXiv 5 Jun 2025.
Builds on
26 of 57 references.
References · 26
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2023Sigmoid Loss for Language Image Pre-Trainingcited by 3,048
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2017Interpretability Beyond Feature Attribution: Quantitative Testing with Concept Activation Vectors (TCAV)cited by 1,309
- 2016The Mythos of Model Interpretabilitycited by 716
- 2023The Linear Representation Hypothesis and the Geometry of Large Language Modelscited by 679
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
- 2013k-Sparse Autoencoderscited by 209
14 more
- 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoderscited by 136
- 2024BatchTopK Sparse Autoencoderscited by 126
- 2023A Holistic Approach to Unifying Automatic Concept Extraction and Concept Importance Estimationcited by 108
- 2018Theoretical Linear Convergence of Unfolded ISTA and its Practical Weights and Thresholdscited by 83
- 2025Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometrycited by 58
- 2014Sparse Modeling for Image and Vision Processingcited by 48
- 2015Simple, Efficient, and Neural Algorithms for Sparse Codingcited by 37
- 2019Learning step sizes for unfolded sparse codingcited by 29
- 2013Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimizationcited by 24
- 2021Stable and Interpretable Unrolled Dictionary Learningcited by 15
- 2016Understanding Trainable Sparse Coding via Matrix Factorizationcited by 12
- 2021Understanding approximate and unrolled dictionary learning for pattern recoverycited by 11
- 2020Learned Greedy Method (LGM): A Novel Neural Architecture for Sparse Coding and Beyondcited by 6
- 2019NOODL: Provable Online Dictionary Learning and Sparse Codingcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026WriteSAE: Sparse Autoencoders for Recurrent Statecited by 1
- 2026WriteSAE: Sparse Autoencoders for Recurrent State12 May 2026