paper-with-me

Papers

Prune, Interpret, Evaluate: A Cross-Layer Transcoder-Native Framework for Efficient Circuit Discovery via Feature Attribution

2026-04-18 · Qinhao Chen, Linyang He, Nima Mesgarani arxiv

Existing feature-interpretation pipelines typically operate on uniformly sampled units or exhaustive feature sets, incurring massive costs on units irrelevant to target behaviors. To address this, we introduce the first CLT-native end-to-end pruning framework, PIE, which pioneers the paradigm of pruning first and interpreting later. PIE connects Pruning, automatic Interpretation, and interpretation Evaluation, establishing a comprehensive benchmarking environment to systematically measure behavioral fidelity and downstream interpretability under pruning. Within this framework, we adapt strong relevance baselines and propose Feature Attribution Patching (FAP), a patch-grounded attribution method that scores CLT features by aggregating gradient-weighted write contributions. Furthermore, we introduce FAP-Synergy, a systematic synergy-aware reranking procedure. We evaluate pruning using KL-divergence behavior retention and assess interpretation quality with FADE-style metrics across IOI and Doc-String datasets. Across budget constraints of K in {50, 100, 200, 400, 800}, our rigorous benchmarking reveals distinct operational regimes: while base FAP and adapted baselines perform robustly at relaxed budgets, FAP-Synergy excels in highly constrained, strict-budget regimes. Crucially, we demonstrate a practical "Effective Budget" advantage: on the IOI task for both Llama-3.2-1B and Gemma-2-2B, FAP-Synergy at K=50 functionally matches the behavioral fidelity of baseline circuits at K=75. Because downstream evaluation costs scale linearly per feature, Synergy effectively grants the pipeline 25 "free" features, achieving K=75 fidelity while reducing interpretation costs by 33%.

📄 PDF Abstract BibTeX arXiv:2604.16889

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Transcoders Find Interpretable LLM Feature Circuits

2024-06-17 · Jacob Dunefsky, Philippe Chlenski, Neel Nanda

A key goal in mechanistic interpretability is circuit analysis: finding sparse subgraphs of models corresponding to specific behaviors or capabilities. However, MLP sublayers make fine-grained circuit analysis on transfo…

CLT-Forge: A Scalable Library for Cross-Layer Transcoders and Attribution Graphs

2026-03-22 · Florent Draye, Abir Harrasse, Vedant Palit, Tung-Yu Wu 외 arxiv

Mechanistic interpretability seeks to understand how Large Language Models (LLMs) represent and process information. Recent approaches based on dictionary learning and transcoders enable representing model computation in…

DifFRACT: Diffusion Feature Reconstruction and Attribution for Circuit Tracing

2026-06-14 · Artyom Mazur, Nina Konovalova, Aibek Alanov arxiv

Mechanistic interpretability seeks to explain neural network behavior by decomposing model computations into interpretable features and circuits. While transcoder-based circuit tracing has recently enabled detailed causa…

Image Generation

Transcoders Trace Visual Grounding and Hallucinations in Vision-Language Models

2026-05-21 · Dimitrios Damianos, Leon Voukoutis, Georgios Skyrianos, Vassilis Katsouros 외 arxiv

Generative Vision-Language Models (VLMs) perform well on multimodal reasoning, but how visual inputs are transformed to text remains poorly understood. Existing interpretability work on VLMs uses Sparse Autoencoders (SAE…

Multimodal ReasoningVisual Grounding

Circuit Tracing in Autoregressive Protein Language Models

2026-06-14 · Darin Tsui, William Deinzer, Daniel Saeedi, Amirali Aghazadeh arxiv

Protein language models (pLMs) can generate novel protein sequences with properties beyond those observed in nature, yet the mechanisms underlying protein generation remain poorly understood. Existing mechanistic interpr…

Representation Learning