paper-with-me

홈 › Papers

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

2026-06-05 · Luyang Zhang, Jialu Wang 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.

📄 PDF Abstract BibTeX arXiv:2606.09899

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Discovering Transformer Circuits via a Hybrid Attribution and Pruning Framework

2025-09-28 · Hao Gu, Vibhas Nair, Amrithaa Ashok Kumar, Jayvart Sharma 외 arxiv

Interpreting language models often involves circuit analysis, which aims to identify sparse subnetworks, or circuits, that accomplish specific tasks. Existing circuit discovery algorithms face a fundamental trade-off: at…

Attribution Patching Outperforms Automated Circuit Discovery

2023-10-16 · Aaquib Syed, Can Rager, Arthur Conmy

Automated interpretability research has recently attracted attention as a potential research direction that could scale explanations of neural network behavior to large models. Existing automated circuit discovery work a…

RelP: Faithful and Efficient Circuit Discovery in Language Models via Relevance Patching

2025-08-28 · Farnoush Rezaei Jafari, Oliver Eberle, Ashkan Khakzar, Neel Nanda arxiv

Activation patching is a standard method in mechanistic interpretability for localizing the components of a model responsible for specific behaviors, but it is computationally expensive to apply at scale. Attribution pat…

Computational Efficiency

Diagnosis Is Not Prescription: Linguistic Co-Adaptation Explains Patching Hazards in LLM Pipelines

2026-05-21 · Yoon Jeonghun, Kim Dongchan arxiv

When a multi-module LLM agent fails, the module most responsible for the failure is not necessarily the best place to intervene. We demonstrate this Diagnostic Paradox empirically: causal analysis consistently identifies…

AtP*: An efficient and scalable method for localizing LLM behaviour to components

2024-03-01 · János Kramár, Tom Lieberum, Rohin Shah, Neel Nanda

Activation Patching is a method of directly computing causal attributions of behavior to model components. However, applying it exhaustively requires a sweep with cost scaling linearly in the number of model components, …