The paper introduces Integrated Policy Gradient (IPG), a training‑free framework that applies policy‑based attribution to large language model reasoning. IPG backpropagates outcome‑level, non‑differentiable signals through entire inference trajectories, using path integration to isolate outcome‑relevant mediators at the component level. Empirical results show that IPG precisely localizes sparse internal components linked to specific reasoning behaviors and enables modulation of reasoning capabilities.
By Changming Li, Kaixing Zhang, Haoyun Xu, Yingdong Shi, Zheng Zhang, Kaitao Song, Kan Ren
The paper introduces Causal Attribution Pruning (CAP), a training‑free technique that identifies critical attention heads in large language models by measuring their causal impact on reasoning tasks. CAP estimates performance loss when each head is masked on a small calibration set, then translates these causal scores into weight‑level importance for pruning. Compared to magnitude‑only or activation‑based methods, CAP achieves up to 61% relative accuracy gains over Wanda on ARC‑Challenge at 20% sparsity and improves performance on GSM8K, StrategyQA, and ARC‑Challenge across Llama‑3‑8B‑Instruct and Mistral‑7B‑Instruct at 10%, 20%, and 50% sparsity.
By Amogh Sheth, Andrew Lin, Biruk Assefa, Yi Wen Huang, Yuhao Ge
arXiv:2605. 23393v2 Announce Type: replace-cross Abstract: Mechanistic interpretability of transformers requires identifying not just which components matter but how they compose into the computational route that produced a prediction.
By Po-Kai Chen, Aske Plaat, Niki van Stein
Circuit Oracle is an off‑the‑shelf large language model that, using a multi‑agent harness and task‑specific skills, can answer natural‑language questions about a target model by reading its attribution graph via tool calls. The system was evaluated on three safety‑relevant proxy tasks—detecting spurious features in probe circuits, eliciting hidden knowledge from taboo‑finetuned models, and suppression jailbreaking via feature‑level interventions—achieving 78.2 % accuracy on spurious‑feature detection and mixed results on the other tasks. In addition to task scores, Circuit Oracle produces pruned subgraphs and context‑specific feature explanations, which the authors release for further study.
By Shariar Kabir, Hong Kiat Tan, Swastik Agrawal, Sai V R Chereddy, Sriram Balasubramanian
The paper introduces TopKLoRA, an interpretable parameter‑efficient fine‑tuning method that activates only the top‑k adapter latents per token. Using this sparse LoRA, the authors fine‑tune large language models on a poisoned dataset, identify and ablate the minimal circuit responsible for a backdoor, and show that the resulting circuits are an order of magnitude smaller than dense LoRA baselines. They also demonstrate how to construct model organisms with localized circuits via gradient‑routing, supporting the development of interpretable‑by‑design architectures.
By Marek Masiak, Andrzej Szablewski, Nicola Cancedda, Constantin Venhoff
The paper introduces SAERL, a method that uses Sparse Autoencoders (SAEs) to guide reinforcement learning data engineering for large language models. By mapping training samples into a feature space of interpretable SAE activations, SAERL selects samples with strong, non‑redundant gradient signals, organizes functional regions from easy to hard, and batches from single activation clusters with moderate mixing. Experiments on mathematical reasoning tasks show consistent performance gains across model scales and RL algorithms, with notable improvements on Qwen2.5-Math-1.5B.
By Yi Jing, Zao Dai, Jinwu Hu, Zijun Yao, Lei Hou, Juanzi Li, Xiaozhi Wang