Skip to content

How Do Linear Probes Emerge? A Circuit-Tracing Framework with Concept-Targeted Attribution

Aug 2026 · 0 citations · 32 references
Computer Science

TL;DR

Concept-Targeted Attribution (CTA) provides a framework for moving from behavioral probe accuracy to mechanistic explanations of probe performance, enabling more detailed audits of internal concept representations, including safety-critical ones.

Abstract

Transcoder attribution graphs are usually trained to explain why a model assigns high probability to a particular next token. We introduce Concept-Targeted Attribution (CTA), which instead trains attribution graphs with respect to a linear probe direction. CTA therefore yields probe-specific circuits that explain why an internal concept representation arises in a prompt, independently of whether it is expressed in the generated token. Using Cross-Layer Transcoders, we show that these probe-targeted graphs contain predictive structure: graph-level features predict probe accuracy across four widely studied concept categories ($\rho = 0.91$, $R^2 = 0.84$), while local features identify the sparse components driving per-prompt classification. This connects probe performance to interpretable circuit structure, allowing us to ask not only whether a probe works, but which internal computations make it work. Causal ablations further show that probe-targeted and logit-targeted graphs capture functionally distinct mechanisms. Removing probe-relevant features reduces internal concept scores while largely preserving generated tokens, whereas removing logit-relevant features changes the generated token in 92% to 100% of cases with near-zero effect on probe scores. CTA provides a framework for moving from behavioral probe accuracy to mechanistic explanations of probe performance, enabling more detailed audits of internal concept representations, including safety-critical ones. Our code is available at https://github.com/vedantpalit/concept-targeted-attribution

View source

Similar papers

Preprint Aug 2026

Circuit Condensation: Post-Training that Concentrates a Behavior's Causal Circuit

Circuit Condensation is introduced, which post-trains models to concentrate behaviors into smaller causal graphs, which are smaller than the strongest frozen baseline in 30 of 32 settings, and shows that weight updates, rather than search alone, drive the reduction.

Sailesh I. S. Kumar · 0 citations
#artificial intelligence Preprint Sep 2026

Decodability is Not Causality: Dissociating Probe Readouts from Behavioral Drivers via SAE Decomposition

A feature-level diagnostic is introduced that decomposes a deployed True/False probe into sparse-autoencoder (SAE) features, ranks those features by both probe alignment and by gradient sensitivity of the model's behavior, and ablates the resulting shared, probe-only, and random feature sets under a coherence gate.

Devesh Tiwari, Camille Davis, Shivank Sinha et al. · 1 citation
#artificial intelligence Preprint Sep 2026

Circuit-Diff: Factual Edit-based Intervention Method for Localizing Knowledge in Attribution Graphs

To make CLTs easier to use for circuit discovery, Circuit-Diff is introduced, which intervenes on the model itself with a low-rank factual edit and takes the features whose role in the attribution graph changes under that edit as related to the edited knowledge.

Edward G. Friedman, Xiang-Chen Song · 0 citations
#natural language process... Preprint Sep 2026

The Answer-Basin Representation Hypothesis: We Are Not Probing or Steering Concepts

The Linear Representation Hypothesis associates high-level concepts with directions in language models, but it remains unclear how these concept-related linear structures are organized within the model. We propose the Answer-Basin Representation Hypothesis: the probability measure induced over answers by the model's co...

Man-Jiang Yu, Hongji Li, Zi-Han Wang et al. · 0 citations
Preprint Aug 2026

Rewriting or Reweighting? A Geometric Account in Language Models

Behavior manifold analysis is introduced, which isolates behavior-specific geometry by selecting sparse behavior-associated coordinates and lifting them into low-dimensional local charts, and provides a unified framework for understanding the mechanistic distinction between the two objectives.

Jun-Tong Wang, Shengkun Yang, Xiyuan Wang et al. · 0 citations
#machine learning Preprint Sep 2026

Rewired or Gated? How Instruction Tuning Shapes Knowledge-Conflict Circuits in LLMs

This work provides the first mechanistic base-vs-instruct comparison of conflict-resolution circuits, and believes that because the conflict circuit is preserved rather than rebuilt, interpretability and control tools calibrated on base models should transfer directly to their deployed instruct siblings.

S. Pandere, Gautam Ranka, Ritika Varshney et al. · 0 citations

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.