Train One Sparse Autoencoder Across Multiple Sparsity Budgets to Preserve Interpretability and Accuracy
On the map: Mechanistic interpretability → Sparse autoencoder training and evaluation
Abstract (arXiv)
Sparse Autoencoders (SAEs) have proven to be powerful tools for interpreting neural networks by decomposing hidden representations into disentangled, interpretable features via sparsity constraints. However, conventional SAEs are constrained by the fixed sparsity level chosen during training; meeting different sparsity requirements therefore demands separate models and increases the computational footprint during both training and evaluation. We introduce a novel training objective, HierarchicalTopK, which trains a single SAE to optimise reconstructions across multiple sparsity levels simultaneously. Experiments with Gemma-2 2B demonstrate that our approach achieves Pareto-optimal trade-offs between sparsity and explained variance, outperforming traditional SAEs trained at individual sparsity levels. Further analysis shows that HierarchicalTopK preserves high interpretability scores even at higher sparsity. The proposed objective thus closes an important gap between flexibility and interpretability in SAE design.
Key facts. Cited by 4 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 7 of its 12 references that are in the map. First posted on arXiv 30 May 2025.
Builds on
7 of 12 references.
Closest ancestors · 2
Same direction, newest first
- 2025Learning Multi-Level Features with Matryoshka Sparse Autoencoders21 Mar
- 2024Interpretability as Compression: Reconsidering SAE Explanations of Neural Activations with MDL-SAEs15 Oct
Other references · 5
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 300
- 2013k-Sparse Autoencoderscited by 215
- 2025SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretabilitycited by 124
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoningcited by 5
- 2026Unstable Features, Reproducible Subspaces: Understanding Seed Dependence in Sparse Autoencoderscited by 1
- 2026HH-SAE: Discovering and Steering Hierarchical Knowledge of Complex Manifoldscited by 0
- 2026ChronoLens: Measuring Language Change Across Time, Languages, and Linguistic Levelscited by 0
- 2026ChronoLens: Measuring Language Change Across Time, Languages, and Linguistic Levels4 Aug 2026
- 2026From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning16 Jun 2026
- 2026Unstable Features, Reproducible Subspaces: Understanding Seed Dependence in Sparse Autoencoders10 Jun 2026
- 2026HH-SAE: Discovering and Steering Hierarchical Knowledge of Complex Manifolds11 May 2026
Similar, not cited
Close in wording, no citation either way
- 2026Beyond the Hard Budget: Sparsity Regularizers for More Interpretable Top-k Sparse Autoencoders
- 2025SplInterp: Improving our Understanding and Training of Sparse Autoencoders
- 2025Interpreting CLIP with Hierarchical Sparse Autoencoders
- 2024Interpreting Attention Layer Outputs with Sparse Autoencoders
- 2024BatchTopK Sparse Autoencoders
- 2026Improving Robustness In Sparse Autoencoders via Masked Regularization
- 2025Data Whitening Improves Sparse Autoencoder Learning
- 2025Evaluating Sparse Autoencoders: From Shallow Design to Matching Pursuit