mlsanityData to 7 Oct 2026

APP: Accelerated Path Patching with Task-Specific Pruning

arXiv 2511.05442 ↗First posted 7 Nov 2025cs.LG cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Circuit discovery is a key step in many mechanistic interpretability pipelines. Current methods, such as Path Patching, are computationally expensive and have limited in-depth circuit analysis for smaller models. In this study, we propose Accelerated Path Patching (APP), a hybrid approach leveraging our novel contrastive attention head pruning method to drastically reduce the search space of circuit discovery methods. Our Contrastive-FLAP pruning algorithm uses techniques from causal mediation analysis to assign higher pruning scores to task-specific attention heads, leading to higher performing sparse models compared to traditional pruning techniques. Although Contrastive-FLAP is successful at preserving task-specific heads that existing pruning algorithms remove at low sparsity ratios, the circuits found by Contrastive-FLAP alone are too large to satisfy the minimality constraint required in circuit analysis. APP first applies Contrastive-FLAP to reduce the search space on required for circuit discovery algorithms by, on average, 56%. Next, APP, applies traditional Path Patching on the remaining attention heads, leading to a speed up of 59.63%-93.27% compared to Path Patching applied to the dense model. Despite the substantial computational saving that APP provides, circuits obtained from APP exhibit substantial overlap and similar performance to previously established Path Patching circuits

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 32 references that are in the map. First posted on arXiv 7 Nov 2025.

Builds on

14 of 32 references.

References · 14

  1. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  4. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  5. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
  6. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 434
  7. 2021Causal Abstractions of Neural Networkscited by 401
  8. 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 328
  9. 2023Attribution Patching Outperforms Automated Circuit Discoverycited by 196
  10. 2020Causal Mediation Analysis for Interpreting Neural NLP: The Case of Gender Biascited by 183
  11. 2023Localizing Model Behavior with Path Patchingcited by 182
  12. 2024Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanismscited by 144
2 more
  1. 2024The Same But Different: Structural Similarities and Differences in Multilingual Language Modelingcited by 27
  2. 2025TRIM: Achieving Extreme Sparsity with Targeted Row-wise Iterative Metric-driven Pruningcited by 1

Built on by

Not cited yet.