Sparse Transformer: a Controlled Testbed for Mechanistic Interpretability
cs.AI
Submitted: 2026-10-14
Updated: 2026-10-14
Code: https://github.com/AntonKorznikov/SparseTransformer
License: http://creativecommons.org/licenses/by/4.0/
The gist: Mechanistic interpretability aims to decompose neural network computations into human-understandable features, yet progress is limited by the absence of ground-truth units to evaluate against.
Terminology
Abstract
Mechanistic interpretability aims to decompose neural network computations into human-understandable features, yet progress is limited by the absence of ground-truth units to evaluate against. We address this with a Sparse Transformer (ST): a 5-layer language model trained on TinyStories whose wide, TopK-sparse MLP forces neuron specialization. We show that ST neurons are highly interpretable: they outperform a loss-matched dense transformer by 43% on AutoInterp, and circuits of a median of 12 neurons suffice to reproduce individual model predictions. This testbed allows us to directly compare feature learning methods: Transcoder, which approximates the MLP input-output mapping, recovers ST's neuron vectors with 52.6% higher cosine similarity than Sparse Autoencoder, which only reconstructs outputs. Furthermore, the ST enables a controlled study of polysemanticity: distilling its sparse MLP into a dense counterpart reveals how compression leads to feature superposition. These results show how a known reference basis sharpens evaluation and understanding, a role we hope the ST can serve for the field.
Sources
- GPT-4 Technical Report
- Language Model Circuits Are Sparse in the Neuron Basis
- BatchTopK Sparse Autoencoders
- Learning Multi-Level Features with Matryoshka Sparse Autoencoders
- Sparse but Wrong: Incorrect L0 Leads to Incorrect Features in Sparse Autoencoders
- SynthSAEBench: Evaluating Sparse Autoencoders on Scalable Realistic Synthetic Data
- Generating Long Sequences with Sparse Transformers
- Sparse Autoencoders Find Highly Interpretable Features in Language Models
- TinyStories: How Small Can Language Models Be and Still Speak Coherent English?
- Toy Models of Superposition
- Weight-sparse transformers have interpretable circuits
- Training Compute-Optimal Large Language Models
- GPT-4o System Card
- Scaling Laws for Neural Language Models
- SAEBench: A Comprehensive Benchmark for Sparse Autoencoders in Language Model Interpretability
- Sanity Checks for Sparse Autoencoders: Do SAEs Beat Random Baselines?
- OrtSAE: Orthogonal Sparse Autoencoders Uncover Atomic Features
- Decoupled Weight Decay Regularization
- A Comprehensive Survey of Mixture-of-Experts: Algorithms, Theory, and Applications
- Progress measures for grokking via mechanistic interpretability
Related papers
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Agents' Last Exam
- The Clinician's Veto: Navigating Trust, Liability, and Uncertainty in Autonomous AI Prescribing
- MindHelper: Closed-Loop Embodied Mental-State Reasoning for Precision Intervention
- Incumbent Advantage: Brand Bias and Cognitive Manipulation Dynamics in LLM Recommendation Systems