Decompose Sparsely Where You Should, Absorb Densely Where You Should No
Not on the map. Why?
Abstract (arXiv)
Sparse autoencoders (SAEs) are typically trained to reconstruct the entire residual stream through a sparse dictionary, implicitly assuming that all activation content is amenable to sparse, monosemantic decomposition. We question this assumption and hypothesize that activations contain a low-rank, dense component that is computationally important to the model yet inherently unsuitable for sparse representation, which serves as a major source of the persistent dense latents widely observed in trained SAEs. To test this, we add a small rank-r linear bottleneck in parallel with standard SAEs (BatchTopK and Matryoshka), allowing dense structure to be absorbed before sparse reconstruction. On Gemma-2-2B layer 12, a rank-24 bottleneck reduces dense latent count by up to 84% while improving sparse probing and targeted probe perturbation on both architectures at matched sparsity. The absorbed component is (i) structurally identifiable as the top principal components and outlier dimensions; (ii) causally necessary, with removing it raising next-token cross-entropy by 7.5×, far exceeding the 2.8× from removing the geometrically near-identical top-24 PCA directions; and (iii) redundantly encoded by sparse dictionaries, with ablating 787 maximally aligned sparse features raising cross-entropy by only 2.9× and ablating 2,048 topic-aligned features leaving MMLU topic classification virtually unchanged, whereas removing the scaffold drops it from 98.7% to chance. Together, our findings identify a compact, semantically informative and causally important component of residual stream activations (which we term a computational scaffold) that standard sparse dictionaries represent inefficiently, suggesting that the scope of sparsity-based interpretability methods warrants careful re-examination.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 30 of its 33 references that are in the map. First posted on arXiv 12 Jun 2026.
Builds on
30 of 33 references.
References · 30
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 770
- 2024Scaling and evaluating sparse autoencoderscited by 530
- 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 381
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
- 2024Massive Activations in Large Language Modelscited by 277
- 2019Representation Degeneration Problem in Training Natural Language Generation Modelscited by 250
- 2017All-but-the-Top: Simple and Effective Postprocessing for Word Representationscited by 205
- 2024Not All Language Model Features Are One-Dimensionally Linearcited by 201
- 2025AxBench: Steering LLMs? Even Simple Baselines Outperform Sparse Autoencoderscited by 199
- 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
- 2026Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnetcited by 175
18 more
- 2024Improving Dictionary Learning with Gated Sparse Autoencoderscited by 171
- 2024A is for Absorption: Studying Feature Splitting and Absorption in Sparse Autoencoderscited by 148
- 2023Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothingcited by 147
- 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoderscited by 136
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoderscited by 133
- 2024BatchTopK Sparse Autoencoderscited by 126
- 2025SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretabilitycited by 118
- 2021BERT Busters: Outlier Dimensions that Disrupt Transformerscited by 110
- 2025Are Sparse Autoencoders Useful? A Case Study in Sparse Probingcited by 109
- 2025Sparse Autoencoders Trained on the Same Data Learn Different Featurescited by 86
- 2025Sparse Autoencoders Do Not Find Canonical Units of Analysiscited by 80
- 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 64
- 2024Spectral Filters, Dark Signals, and Attention Sinkscited by 54
- 2024Decomposing The Dark Matter of Sparse Autoencoderscited by 42
- 2024Efficient Dictionary Learning with Switch Sparse Autoencoderscited by 38
- 2025Automated Interpretability Metrics Do Not Distinguish Trained and Random Transformerscited by 30
- 2025Transcoders Beat Sparse Autoencoders for Interpretabilitycited by 22
- 2025Dense SAE Latents Are Features, Not Bugscited by 17
Built on by
Not cited yet.