mlsanityData to 7 Oct 2026

PAHQ: Accelerating Automated Circuit Discovery through Mixed-Precision Inference Optimization

arXiv 2510.23264 ↗First posted 27 Oct 2025cs.LG cs.AIcited by 3

Not on the map. Why?

Abstract (arXiv)

Circuit discovery, which involves identifying sparse and task-relevant subnetworks in pre-trained language models, is a cornerstone of mechanistic interpretability. Automated Circuit Discovery (ACDC) has emerged as a pivotal methodology in circuit discovery, but its application to large language models is severely limited by computational inefficiency and prohibitively high memory requirements. Although several accelerated approaches have been proposed, they primarily rely on linear approximations to ACDC, which significantly compromises analytical faithfulness. Our proposed method for accelerating automated circuit discovery, Per Attention Head Quantization (PAHQ), takes a fundamentally different approach by optimizing the efficiency of each individual patching operation. PAHQ leverages a fundamental alignment between activation patching and mixed-precision quantization (MPQ): interpretability analysis through patching essentially performs targeted ablation studies. Therefore, we can maintain high precision exclusively for investigated components while safely reducing precision elsewhere in the network. PAHQ-accelerated ACDC reduces runtime by up to 80% and memory consumption by up to 30% compared to unaccelerated ACDC while maintaining faithfulness. Importantly, our method readily integrates with existing edge-based circuit discovery techniques by modifying the attention computation mechanism. This training-free approach provides a practical and novel pathway for accelerating mechanistic interpretability methods. Our code is available at https://github.com/626619403/PAHQ.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 24 of its 47 references that are in the map. First posted on arXiv 27 Oct 2025.

Builds on

24 of 47 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  3. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  4. 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
  5. 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
  6. 2017Mixed Precision Trainingcited by 1,135
  7. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  8. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  9. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
  10. 2019Are Sixteen Heads Really Better than One?cited by 803
  11. 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
  12. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
12 more
  1. 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
  2. 2018Quantizing deep convolutional networks for efficient inference: A whitepapercited by 507
  3. 2021A White Paper on Neural Network Quantizationcited by 453
  4. 2024Mechanistic Interpretability for AI Safety -- A Reviewcited by 415
  5. 2019Data-Free Quantization Through Weight Equalization and Bias Correctioncited by 328
  6. 2024Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanismscited by 144
  7. 2021Causal Analysis of Syntactic Agreement Mechanisms in Neural Language Modelscited by 127
  8. 2022FP8 Quantization: The Power of the Exponentcited by 87
  9. 2021Low-Complexity Probing via Finding Subnetworkscited by 63
  10. 2024Finding Transformer Circuits with Edge Pruningcited by 58
  11. 2024ResQ: Mixed-Precision Quantization of Large Language Models with Low-Rank Residualscited by 32
  12. 2024Transformer Circuit Faithfulness Metrics are not Robustcited by 18

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.