mlsanityData to 7 Oct 2026

When Attribution Patching Lies: Diagnosis and a Second-Order Correction

arXiv 2606.09899 ↗First posted 5 Jun 2026cs.LG cs.AIcited by 2

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

  1. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  2. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
  3. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  4. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  5. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
  6. 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
  7. 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 328
  8. 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
  9. 2023Finding Alignments Between Interpretable Causal Variables and Distributed Neural Representationscited by 197
  10. 2023Attribution Patching Outperforms Automated Circuit Discoverycited by 196
  11. 2023Causal Abstraction: A Theoretical Foundation for Mechanistic Interpretabilitycited by 194
  12. 2024How to use and interpret activation patchingcited by 191
16 more
  1. 2025Open Problems in Mechanistic Interpretabilitycited by 173
  2. 2020The Lipschitz Constant of Self-Attentioncited by 171
  3. 2020Explaining Explanations: Axiomatic Feature Interactions for Deep Networkscited by 103
  4. 2023Interpretability at Scale: Identifying Causal Mechanisms in Alpacacited by 102
  5. 2024AtP*: An efficient and scalable method for localizing LLM behaviour to componentscited by 100
  6. 2025MIB: A Mechanistic Interpretability Benchmarkcited by 49
  7. 2026Emotion Concepts and their Function in a Large Language Modelcited by 48
  8. 2024Hypothesis Testing the Circuit Hypothesis in LLMscited by 29
  9. 2024InterpBench: Semi-Synthetic Transformers for Evaluating Mechanistic Interpretability Techniquescited by 24
  10. 2025EAP-GP: Mitigating Saturation Effect in Gradient-based Automated Circuit Identificationcited by 21
  11. 2025Mechanistic Interpretability as Statistical Estimation: A Variance Analysiscited by 14
  12. 2025RelP: Faithful and Efficient Circuit Discovery in Language Models via Relevance Patchingcited by 10
  13. 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guaranteescited by 10
  14. 2026Certified Circuits: Stability Guarantees for Mechanistic Circuitscited by 4
  15. 2024Compositional Curvature Bounds for Deep Neural Networkscited by 3
  16. 2024From Robustness to Improved Generalization and Calibration in Pre-trained Language Modelscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.