When Attribution Patching Lies: Diagnosis and a Second-Order Correction
Not on the map. Why?
Abstract (arXiv)
A central goal of mechanistic interpretability is to identify which internal components causally drive a language model's behavior. Because these importance estimates serve as the evidence for identifying circuits, systematic errors can lead to the misidentification of the underlying mechanisms. While activation patching provides a gold-standard causal metric, its computational cost is prohibitive at scale. Practitioners instead rely on attribution patching, a gradient-based, first-order approximation whose reliability remains poorly understood. In this work, we characterize the source of this unreliability, demonstrating that the dominant error stems from the non-linearities in the downstream network rather than local curvature at the patched component. This insight yields three practical tools: (i) a reliability score to detect untrustworthy estimates, (ii) error bounds quantifying potential attribution mis-specifications, and (iii) a Hessian-vector-product (HVP) correction that eliminates the leading-order error with only one additional backward pass. In evaluations across five model families (124M-9B parameters) and both random-token and naturalistic (name-swap) perturbations, HVP is the only second-order correction feasible at larger scale, where standard baselines like Integrated Gradients become computationally prohibitive. In comparative experiments, a multi-step HVP variant matches or exceeds the accuracy of Integrated Gradients at significantly lower compute, outperforming prior second-order baselines. These improvements lead to higher-fidelity circuit recovery on standard benchmarks and support a Screen-Flag-Fix workflow that targets computational effort only toward the components flagged as unreliable.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 5 Jun 2026.
Builds on
28 of 37 references.
References · 28
- 2017Axiomatic Attribution for Deep Networkscited by 3,350
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
- 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 328
- 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
- 2023Finding Alignments Between Interpretable Causal Variables and Distributed Neural Representationscited by 197
- 2023Attribution Patching Outperforms Automated Circuit Discoverycited by 196
- 2023Causal Abstraction: A Theoretical Foundation for Mechanistic Interpretabilitycited by 194
- 2024How to use and interpret activation patchingcited by 191
16 more
- 2025Open Problems in Mechanistic Interpretabilitycited by 173
- 2020The Lipschitz Constant of Self-Attentioncited by 171
- 2020Explaining Explanations: Axiomatic Feature Interactions for Deep Networkscited by 103
- 2023Interpretability at Scale: Identifying Causal Mechanisms in Alpacacited by 102
- 2024AtP*: An efficient and scalable method for localizing LLM behaviour to componentscited by 100
- 2025MIB: A Mechanistic Interpretability Benchmarkcited by 49
- 2026Emotion Concepts and their Function in a Large Language Modelcited by 48
- 2024Hypothesis Testing the Circuit Hypothesis in LLMscited by 29
- 2024InterpBench: Semi-Synthetic Transformers for Evaluating Mechanistic Interpretability Techniquescited by 24
- 2025EAP-GP: Mitigating Saturation Effect in Gradient-based Automated Circuit Identificationcited by 21
- 2025Mechanistic Interpretability as Statistical Estimation: A Variance Analysiscited by 14
- 2025RelP: Faithful and Efficient Circuit Discovery in Language Models via Relevance Patchingcited by 10
- 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guaranteescited by 10
- 2026Certified Circuits: Stability Guarantees for Mechanistic Circuitscited by 4
- 2024Compositional Curvature Bounds for Deep Neural Networkscited by 3
- 2024From Robustness to Improved Generalization and Calibration in Pre-trained Language Modelscited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.