mlsanityData to 7 Oct 2026

Weight-sparse transformers have interpretable circuits

arXiv 2511.13653 ↗First posted 17 Nov 2025cs.LG cs.AIcited by 40

Not on the map. Why?

Abstract (arXiv)

Finding human-understandable circuits in language models is a central goal of the field of mechanistic interpretability. We train models to have more understandable circuits by constraining most of their weights to be zeros, so that each neuron only has a few connections. To recover fine-grained circuits underlying each of several hand-crafted tasks, we prune the models to isolate the part responsible for the task. These circuits often contain neurons and residual channels that correspond to natural concepts, with a small number of straightforwardly interpretable connections between them. We study how these models scale and find that making weights sparser trades off capability for interpretability, and scaling model size improves the capability-interpretability frontier. However, scaling sparse models beyond tens of millions of nonzero parameters while preserving interpretability remains a challenge. In addition to training weight-sparse models de novo, we show preliminary results suggesting our method can also be adapted to explain existing dense models. Our work produces circuits that achieve an unprecedented level of human understandability and validates them with considerable rigor.

Key facts. Cited by 40 papers in the map (data through 7 Oct 2026). Builds on 48 of its 70 references that are in the map. First posted on arXiv 17 Nov 2025.

Builds on

48 of 70 references.

References · 48

  1. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  2. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  3. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  4. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  5. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
  6. 2019Root Mean Square Layer Normalizationcited by 1,425
  7. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  8. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  9. 2022Toy Models of Superpositioncited by 928
  10. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  12. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
36 more
  1. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
  2. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
  3. 2020What is the State of Neural Network Pruning?cited by 578
  4. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
  5. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 561
  6. 2024Scaling and evaluating sparse autoencoderscited by 530
  7. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  8. 2019The State of Sparsity in Deep Neural Networkscited by 471
  9. 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 425
  10. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
  11. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
  12. 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
  13. 2024Jumping Ahead: Improving Reconstruction Fidelity with JumpReLU Sparse Autoencoderscited by 283
  14. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
  15. 2024How to use and interpret activation patchingcited by 191
  16. 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
  17. 2021Thinking Like Transformerscited by 182
  18. 2022Transformer Language Models without Positional Encodings Still Learn Positional Informationcited by 148
  19. 2023Does Circuit Analysis Interpretability Scale? Evidence from Multiple Choice Capabilities in Chinchillacited by 145
  20. 2024AtP*: An efficient and scalable method for localizing LLM behaviour to componentscited by 100
  21. 2021An Interpretability Illusion for BERTcited by 94
  22. 2021Leveraging Sparse Linear Layers for Debuggable Deep Networkscited by 82
  23. 2021Top-KAST: Top-K Always Sparse Trainingcited by 79
  24. 2023Is This the Subspace You Are Looking for? An Interpretability Illusion for Subspace Activation Patchingcited by 75
  25. 2024Identifying Functionally Important Features with End-to-End Sparse Dictionary Learningcited by 64
  26. 2021Low-Complexity Probing via Finding Subnetworkscited by 63
  27. 2019The Difficulty of Training Sparse Neural Networkscited by 62
  28. 2024Finding Transformer Circuits with Edge Pruningcited by 58
  29. 2024Mathematical Models of Computation in Superpositioncited by 34
  30. 2025Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decompositioncited by 25
  31. 2023Interpretability Illusions in the Generalization of Simplified Modelscited by 24
  32. 2025Stochastic Parameter Decompositioncited by 14
  33. 2023Tune As You Scale: Hyperparameter Optimization For Compute Efficient Trainingcited by 9
  34. 2025Jacobian Sparse Autoencoders: Sparsify Computations, Not Just Activationscited by 9
  35. 2024Approximate Top-k for Increased Parallelismcited by 5
  36. 2025On the creation of narrow AI: hierarchy and nonlocality of neural network skillscited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 3; 2026: 37.

40 papers.

Sort:

By area:

  1. 2026Locate, Steer, and Improve: A Practical Survey of Actionable Mechanistic Interpretability in Large Language Modelscited by 22
  2. 2026Language Model Circuits Are Sparse in the Neuron Basiscited by 18
  3. 2025Towards mechanistic understanding in a data-driven weather model: internal activations reveal interpretable physical featurescited by 8
  4. 2026From Weights to Activations: Is Steering the Next Frontier of Adaptation?cited by 8
  5. 2026The Expert Strikes Back: Interpreting Mixture-of-Experts Language Models at Expert Levelcited by 7
  6. 2025Intrinsically Interpretable Attention via Sparse Post-Trainingcited by 4
  7. 2026CodeCircuit: Toward Inferring LLM-Generated Code Correctness via Attribution Graphscited by 3
  8. 2026Towards Intrinsic Interpretability of Large Language Models:A Survey of Design Principles and Architecturescited by 3
  9. 2026Automated Interpretability and Feature Discovery in Language Models with Agentscited by 3
  10. 2026HydraHead: From Head-Level Functional Heterogeneity to Specialized Attention Hybridizationcited by 3
  11. 2026Steering Vision-Language Models with Joint Sparse Autoencoderscited by 3
  12. 2026Superposition Without Interference? Towards Isolated Interventions via Almost Orthogonal Features in Language Modelscited by 2
28 more
  1. 2026Demystifying Variance in Circuit Discovery of LLMscited by 2
  2. 2026Circuit Claims Depend on What Is Extracted and How It Is Comparedcited by 2
  3. 2026How Do LLMs and VLMs Understand Viewpoint Rotation Without Vision? An Interpretability Studycited by 1
  4. 2026From Mechanistic to Compositional Interpretabilitycited by 1
  5. 2026Auditing Asset-Specific Preferences in Financial Large Language Models: Evidence from Bitcoin Representations and Portfolio Allocationcited by 1
  6. 2026Sparse Weight Decomposition for Efficient Circuit Extractioncited by 1
  7. 2025Mechanistic Evidence for Preserved-but-Misaligned Representations in Non-IID FedAvgcited by 0
  8. 2026Hierarchical Sparse Circuit Extraction from Billion-Parameter Language Models through Scalable Attribution Graph Decompositioncited by 0
  9. 2026Token Entropy Regularization for Multi-modal Antenna Affiliation Identificationcited by 0
  10. 2026Efficient Representations are Controllable Representationscited by 0
  11. 2026Scaling GraphLLM with Bilevel-Optimized Sparse Queryingcited by 0
  12. 2026Transcoder Adapters for Reasoning-Model Diffingcited by 0
  13. 2026Why Does It Look There? Structured Explanations for Image Classificationcited by 0
  14. 2026Sparse but not Simpler: A Multi-Level Interpretability Analysis of Vision Transformerscited by 0
  15. 2026Unveiling the Reasoning Process of Large Language Modelscited by 0
  16. 2026Crafting Reversible SFT Behaviors in Large Language Modelscited by 0
  17. 2026Towards Verifiable Transformers: Solver-Checkable Circuit Explanationscited by 0
  18. 2026A theoretical model for task routing in mixture-of-expert transformerscited by 0
  19. 2026Individual Parameters in Weight-Sparse Transformers Appear Interpretablecited by 0
  20. 2026Data-Efficient Adaptation of LLMs via Attention Head Reweightingcited by 0
  21. 2026Scaling Interpretable Transformers with Parity Bottleneck Layerscited by 0
  22. 2026Circuit Condensation: Post-Training that Concentrates a Behavior's Causal Circuitcited by 0
  23. 2026The Misery of Mechanistic Interpretability: A Formal Perspectivecited by 0
  24. 2026MechSparse: Mechanism-Guided Sparse PEFT Selection Is Task-Shapedcited by 0
  25. 2026CASS: Contribution-Aware Structured Sparsity for Model Mergingcited by 0
  26. 2026Explainability from Training with Applications to TCR-Epitope Predictioncited by 0
  27. 2026On-Policy Parameter Update Direction Underlies Generalization in LLM Post-Trainingcited by 0
  28. 2026Weights Read and Write Features: Scalable Parameter Decomposition Grounded in Activation Spacecited by 0