- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper shows that a faithful circuit can combine different computations across examples. It proposes Data-driven Circuit Discovery (DCD), which groups examples before circuit discovery, with DCD-Cluster using per-example edge attributions. Experiments on four tasks across three models examine circuit transfer and compare clustering with random grouping. Cross-task separation works well, while within-task results are less consistent.
Critical strengths
-
Conceptual Insight: The paper highlights a critical blind spot in current circuit discovery—showing convincingly that high faithfulness does not guarantee a single, coherent underlying mechanism. This serves as a valuable sanity check for the community.
-
Dataset Sensitivity: The within-task analysis offers a helpful empirical demonstration of how sensitive recovered circuits are to variations in dataset composition.
Critical weaknesses
-
Limited methodological novelty. The paper offers a useful empirical observation, but the proposed method mainly adds clustering of per-example attributions to an existing circuit-discovery pipeline. I find the methodological advance modest. Comparison with random grouping does not establish whether attribution-based grouping provides more insight than simpler grouping based on input or hidden-state representations.
-
Dependence on a known variant count. The within-task experiments set the number of clusters to the known number of input variants because automatic selection tends to over-split. This leaves it unclear how reliably DCD can identify useful groups when the dataset’s structure is not known in advance.
Questions for authors
-
Requested comparison: How does attribution-based clustering compare with clustering input or hidden-state representations, using the same number of groups and the same circuit-discovery settings? This would help establish what the attribution information adds.
-
Clarification: How do the within-task conclusions change when the number of clusters is selected automatically? Does the reported over-splitting mainly create redundant groups, or does it change which circuit distinctions can be recovered?
-
Clarification: For one within-task example, could you explain what different computations the recovered circuits suggest, and which intervention results support that interpretation? This would help me understand what is learned beyond recovering the known input variants.
-
Contribution and novelty: Could you explain more concretely how the contribution differs from the closest prior work? I currently see the main contribution as the empirical evidence for within-task heterogeneity. What does the proposed grouping procedure add beyond this observation and the use of existing attribution and clustering methods?
5 comments
Thank you again for the constructive review. As the discussion period draws to a close, we wanted to follow up to see whether our rebuttal adequately addresses the points you raised. We would gladly engage further on any aspect that remains unclear. Thanks again!
Thank you again for the constructive review. As the discussion period ends tomorrow, we wanted to follow up to see whether our rebuttal adequately addresses the points you raised. We would gladly engage further on any aspect that remains unclear. Thanks again!
New Experiments: Causal Validation of Distinct Mechanisms Within the Same Task; Automatic Cluster Selection and Its Impact on Circuit Recovery; Comparison of Attribution-Based, Hidden-State, and Sentence-Embedding Grouping
We thank the reviewer for recognizing the importance of DCD's central observation and its within-task analysis. We address the concerns below; new results and clarifications will be included in the revision.
W1 – Novelty: We believe DCD's contribution goes beyond adding clustering to an existing circuit-discovery method; DCD-Cluster is only one instantiation of the broader framework. Our central contribution is identifying and addressing a limitation in the standard workflow, which typically discovers a single circuit for a task dataset without accounting for mechanistic diversity within it. This limitation cannot be resolved simply by improving edge-attribution methods such as EAP and EAP-IG, since it concerns how examples are grouped before circuit discovery.
We agree that random grouping alone is insufficient to establish the value of attribution-based grouping. In Appendix D.3, we compare against a representative-circuit baseline adapted from Franco et al. (2026), showing that constructing circuits from aggregated group evidence achieves higher faithfulness. We also compare hidden-state and sentence-embedding clustering under matched settings (Q1).
W2/Q2 – Automatic K: We evaluated gap statistic, elbow, and silhouette across seven within-task datasets, which selected K = 9–12 compared with 2–8 known variants. On GPT-2 IOI names-vs-letters, automatic K selects 12 instead of the fixed K = 2. We observe that (1) known variants remain separated, forming seven names-only and five letters-only clusters, also observed on Llama and Qwen; (2) additional groups may be redundant, as swapping sibling circuits produces little faithfulness loss (median 0.015); and (3) some groups become very small, with four containing fewer than 10 examples. Thus, automatic K can preserve variant distinctions without knowing their count, but over-splitting may create redundant groups and hinder recovery of the original circuit distinctions.
Q1 – Grouping baselines: DCD is a general framework for grouping examples before circuit discovery. Attribution-based DCD-Cluster, hidden-state, and sentence-embedding are all valid instantiations. To evaluate these instantiations, we compared them on Llama-3.1-8B, keeping K, EAP-IG circuit discovery, circuit size (5% of edges), and evaluation fixed. Across seven within-task datasets, best-of-K faithfulness is comparable: 1.074 (attribution), 1.061 (hidden states), and 1.064 (sentence embeddings). These results demonstrate that DCD can achieve comparable circuit-set coverage using different grouping strategies. However, comparable faithfulness does not necessarily imply that the resulting groups capture the same mechanisms; establishing such distinctions requires additional transfer and causal analysis.
Q3 – What the circuits compute: To answer this, we investigated the two circuits discovered by DCD-Cluster from a mixed dataset of IOI names and letters on GPT-2. Building on the IOI circuit characterized by Wang et al. (2023), we find that both the names and letters circuits share duplicate-token, induction, and S-inhibition heads, but differ in their downstream answer-retrieval mechanisms:
We counterfactually patched components in the full model on 200 held-out prompts per variant. Values are fractions of recoverable logit difference lost:
Variant-exclusive edge interventions show a double dissociation: disrupting edges specific to the names circuit primarily affects names, while disrupting edges specific to the letters circuit primarily affects letters. Together, these findings demonstrate how DCD can generate useful hypotheses about mechanistic differences within the same task, which can then be investigated and validated through causal interventions.
Q4 – Contribution: Beyond demonstrating within-task heterogeneity, DCD introduces a change to the standard circuit-discovery workflow to account for it: grouping examples before constructing circuits. This limitation cannot be addressed simply by improving attribution methods such as EAP or EAP-IG, since it concerns how examples are grouped for circuit discovery. Importantly, attribution-based clustering (DCD-Cluster) is only one instantiation of this broader framework, rather than the primary contribution itself.