TopK Language Models
On the map: Mechanistic interpretability → SAE features and their applications
Abstract (arXiv)
Sparse autoencoders (SAEs) have become an important tool for analyzing and interpreting the activation space of transformer-based language models (LMs). However, SAEs suffer several shortcomings that diminish their utility and internal validity. Since SAEs are trained post-hoc, it is unclear if the failure to discover a particular concept is a failure on the SAE's side or due to the underlying LM not representing this concept. This problem is exacerbated by training conditions and architecture choices affecting which features an SAE learns. When tracing how LMs learn concepts during training, the lack of feature stability also makes it difficult to compare SAEs features across different checkpoints. To address these limitations, we introduce a modification to the transformer architecture that incorporates a TopK activation function at chosen layers, making the model's hidden states equivalent to the latent features of a TopK SAE. This approach eliminates the need for post-hoc training while providing interpretability comparable to SAEs. The resulting TopK LMs offer a favorable trade-off between model size, computational efficiency, and interpretability. Despite this simple architectural change, TopK LMs maintain their original capabilities while providing robust interpretability benefits. Our experiments demonstrate that the sparse representations learned by TopK LMs enable successful steering through targeted neuron interventions and facilitate detailed analysis of neuron formation processes across checkpoints and layers. These features make TopK LMs stable and reliable tools for understanding how language models learn and represent concepts, which we believe will significantly advance future research on model interpretability and controllability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in SAE features and their applications, one of 13 directions in Mechanistic interpretability. Builds on 32 of its 43 references that are in the map. First posted on arXiv 26 Jun 2025.
Builds on
32 of 43 references.
Closest ancestors · 7
Same direction, newest first
- 2025A Survey on Sparse Autoencoders: Interpreting the Internal Mechanisms of Large Language Models7 Mar
- 2025Sparse Autoencoders Trained on the Same Data Learn Different Features28 Jan
- 2024Tracking the Feature Dynamics in LLM Training: A Mechanistic Study23 Dec
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoders27 Oct
- 2024Automatically Interpreting Millions of Features in Large Language Models17 Oct
- 2024Improving Dictionary Learning with Gated Sparse Autoencoders24 Apr
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Models15 Sep
Other references · 25
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2019Generating Long Sequences with Sparse Transformerscited by 1,546
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 992
- 2023Semantic Uncertainty: Linguistic Invariances for Uncertainty Estimation in Natural Language Generationcited by 819
- 2023PyTorch FSDP: Experiences on Scaling Fully Sharded Data Parallelcited by 660
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
13 more
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2021Causal Abstractions of Neural Networkscited by 422
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2021Sparse is Enough in Scaling Transformerscited by 86
- 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
- 2022The State of Sparse Training in Deep Reinforcement Learningcited by 61
- 2025Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometrycited by 61
- 2021Memory-efficient Transformers via Top-k Attentioncited by 60
- 2023Codebook Features: Sparse and Discrete Interpretability for Neural Networkscited by 48
- 2019How Can We Be So Dense? The Benefits of Using Highly Sparse Representationscited by 45
- 2021Two Sparsities Are Better Than One: Unlocking the Performance Benefits of Sparse-Sparse Networkscited by 15
- 2025STEP: Staged Parameter-Efficient Pre-training for Large Language Modelscited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024BatchTopK Sparse Autoencoders
- 2026SoftSAE: Dynamic Top-K Selection for Adaptive Sparse Autoencoders
- 2026Active Budget Can Kill Sensitivity: Diagnosing and Repairing TopK Sparse Autoencoder Reliability
- 2025Evaluating and Designing Sparse Autoencoders by Approximating Quasi-Orthogonality
- 2025Are Sparse Autoencoders Useful? A Case Study in Sparse Probing
- 2025AdaptiveK: Complexity-Driven Sparse Autoencoders for Interpretable Language Model Representations
- 2024Residual Stream Analysis with Multi-Layer SAEs
- 2024Interpreting Attention Layer Outputs with Sparse Autoencoders