Matryoshka attribution: Learning to attribute language model outputs to representations and weights
Not on the map. Why?
Abstract (arXiv)
Attributing language model outputs to their internal computations is an open problem in interpretability. Existing methods, which use causal interventions, gradients, or learnable masks, either are infeasibly expensive or struggle to identify actual causally-important internal computations. We propose framing attribution as the problem of identifying nested subsets of internal components which minimise a downstream loss. To learn this task, we introduce Matryoshka Attribution (MAttr), a mask learning method that parametrises the mask with a simple differentiable sigmoid top-k operator. We supervise training over all sparsities simultaneously by randomising k over training, resulting in a learned ordering of components by attribution score. MAttr achieves number 1 on the official leaderboard of the Mechanistic Interpretability Benchmark (Mueller et al., 2025); our method identifies sparse and task-transferrable circuits across varying circuit bases. As a practical application, we show that MAttr can be trained with reinforcement learning to identify weight changes responsible for downstream behaviours in LLM finetuning. We train MAttr on refusal judge scores and find that restoring 1% of Llama 3.1 8B Instruct's weights to their base model state is sufficient to remove refusals while maintaining capabilities. We view MAttr as a successful formulation of interpretability into a learnable objective that we can tackle with gradient descent, and encourage future work along these lines.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 103 references that are in the map. First posted on arXiv 22 Sep 2026.
Builds on
31 of 103 references.
References · 31
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2013Deep Inside Convolutional Networks: Visualising Image Classification Models and Saliency Mapscited by 2,371
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
- 2017SmoothGrad: removing noise by adding noisecited by 1,109
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 724
- 2019The State of Sparsity in Deep Neural Networkscited by 476
- 2025Reasoning Models Don't Always Say What They Thinkcited by 415
- 2023Localizing Model Behavior with Path Patchingcited by 195
- 2023The Hydra Effect: Emergent Self-repair in Language Model Computationscited by 156
- 2024Llama Scope: Extracting Millions of Features from Llama-3.1-8B with Sparse Autoencoderscited by 143
19 more
- 2019On Empirical Comparisons of Optimizers for Deep Learningcited by 103
- 2025Model Organisms for Emergent Misalignmentcited by 91
- 2025Auditing language models for hidden objectivescited by 83
- 2023Bactrian-X: Multilingual Replicable Instruction-Following Models with Low-Rank Adaptationcited by 81
- 2024Finding Transformer Circuits with Edge Pruningcited by 60
- 2025Weird Generalization and Inductive Backdoors: New Ways to Corrupt LLMscited by 55
- 2025Activation Oracles: Training and Evaluating LLMs as General-Purpose Activation Explainerscited by 52
- 2023Discovering Variable Binding Circuitry with Desideratacited by 34
- 2026Language Model Circuits Are Sparse in the Neuron Basiscited by 25
- 2018Computationally Efficient Measures of Internal Neuron Importancecited by 20
- 2025Stochastic Parameter Decompositioncited by 16
- 2025RelP: Faithful and Efficient Circuit Discovery in Language Models via Relevance Patchingcited by 13
- 2025Predictive Concept Decoders: Training Scalable End-to-End Interpretability Assistantscited by 12
- 2026Arithmetic in the Wild: Llama uses Base-10 Addition to Reason About Cyclic Conceptscited by 10
- 2026GRP-Obliteration: Unaligning LLMs With a Single Unlabeled Promptcited by 7
- 2025Correcting Gradient-Based Circuit Localization via Interaction-Aware Backpropagationcited by 5
- 2026Pando: Do Interpretability Methods Work When Models Won't Explain Themselves?cited by 4
- 2026Tail-Likelihood Reinforcement Learningcited by 3
- 2026ADAG: Automatically Describing Attribution Graphscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026When Attribution Patching Lies: Diagnosis and a Second-Order Correction
- 2026Pruning via Causal Attribution Preserves Reasoning Performance in Large Language Models
- 2026Probing for Knowledge Attribution in Large Language Models
- 2026Hessian-Enhanced Token Attribution (HETA): Interpreting Autoregressive LLMs
- 2025Explaining the Reasoning of Large Language Models Using Attribution Graphs
- 2026CLT-Forge: A Scalable Library for Cross-Layer Transcoders and Attribution Graphs
- 2026The Attribution Contract for Generative Language Models
- 2026Contrastive Attribution in the Wild: An Interpretability Analysis of LLM Failures on Realistic Benchmarks