Circuit Condensation: Post-Training that Concentrates a Behavior's Causal Circuit
Not on the map. Why?
Abstract (arXiv)
One approach to mechanistic interpretability explains behavior through circuits: the components and connections that carry it. Frozen discovery often returns hundreds of edges, making them hard to inspect, compare, or verify exhaustively. We introduce Circuit Condensation, which post-trains models to concentrate behaviors into smaller causal graphs. Each round prunes low-attribution edges and trains a low-rank adapter to match the original through what remains, retaining the cut only if task performance and general capability survive. Across four behaviors and eight models, condensed circuits are smaller than the strongest frozen baseline in 30 of 32 settings, by 8.1× on average and up to 316×. Repeating the search without weight updates produces larger circuits in 29 of 32 settings, showing that weight updates, rather than search alone, drive the reduction. Testing every subset of 19 circuits finds 11 that cannot be reduced and reveals removable edges in the rest. Pair ablations expose dependencies between edges, showing that their effects cannot be understood independently. On indirect object identification, condensation isolates 24 heads, 17 of them with documented roles, against 61 heads and 36 undocumented ones for the matched frozen circuit: a sufficient sub-circuit of the published mechanism rather than a reconstruction of it. The resulting circuit tracks the original model's next-token distribution and predicts its errors.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 45 of its 51 references that are in the map. First posted on arXiv 27 Aug 2026.
Builds on
45 of 51 references.
References · 45
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2022Locating and Editing Factual Associations in GPTcited by 2,609
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,359
- 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
- 2022Mass-Editing Memory in a Transformercited by 976
- 2022In-context Learning and Induction Headscited by 930
- 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 700
- 2024Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Modelscited by 412
- 2021Causal Abstractions of Neural Networkscited by 401
- 2016Assessing the Ability of LSTMs to Learn Syntax-Sensitive Dependenciescited by 350
33 more
- 2023Towards Best Practices of Activation Patching in Language Models: Metrics and Methodscited by 328
- 2025AxBench: Steering LLMs? Even Simple Baselines Outperform Sparse Autoencoderscited by 199
- 2023Attribution Patching Outperforms Automated Circuit Discoverycited by 196
- 2024Transcoders Find Interpretable LLM Feature Circuitscited by 186
- 2023Localizing Model Behavior with Path Patchingcited by 182
- 2024Have Faith in Faithfulness: Going Beyond Circuit Overlap When Finding Model Mechanismscited by 144
- 2024Fine-Tuning Enhances Existing Mechanisms: A Case Study on Entity Trackingcited by 140
- 2021Inducing Causal Structure for Interpretable Neural Networkscited by 107
- 2024AtP*: An efficient and scalable method for localizing LLM behaviour to componentscited by 100
- 2024Information Flow Routes: Automatically Interpreting Language Models at Scalecited by 92
- 2024LLM Circuit Analyses Are Consistent Across Training and Scalecited by 60
- 2024Finding Transformer Circuits with Edge Pruningcited by 58
- 2025Weight-sparse transformers have interpretable circuitscited by 40
- 2023Seeing is Believing: Brain-Inspired Modular Training for Mechanistic Interpretabilitycited by 38
- 2024Efficient Automated Circuit Discovery in Transformers using Contextual Decompositioncited by 23
- 2025EAP-GP: Mitigating Saturation Effect in Gradient-based Automated Circuit Identificationcited by 21
- 2024Transformer Circuit Faithfulness Metrics are not Robustcited by 18
- 2026Language Model Circuits Are Sparse in the Neuron Basiscited by 18
- 2025Position-aware Automatic Circuit Discoverycited by 14
- 2025Mechanistic Interpretability as Statistical Estimation: A Variance Analysiscited by 14
- 2024Sheaf Discovery with Joint Computation Graph Pruning and Flexible Granularitycited by 11
- 2025Reinforcement Learning Fine-Tuning Enhances Activation Intensity and Diversity in the Internal Circuitry of LLMscited by 8
- 2026All Circuits Lead to Rome: Rethinking Functional Anisotropy in Circuit and Sheaf Discovery for LLMscited by 8
- 2025Intrinsically Interpretable Attention via Sparse Post-Trainingcited by 4
- 2026Certified Circuits: Stability Guarantees for Mechanistic Circuitscited by 4
- 2026Navigating by Old Maps: The Pitfalls of Static Mechanistic Localization in LLM Post-Trainingcited by 3
- 2026Quantifying LLM Attention-Head Stability: Implications for Circuit Universalitycited by 2
- 2026How Much Do Circuits Tell Us? Measuring the Consistency and Specificity of Language Model Circuitscited by 2
- 2026Data-driven Circuit Discovery for Interpretability of Language Modelscited by 2
- 2026Many Circuits, One Mechanism: Input Variation and Evaluation Granularity in Circuit Discoverycited by 2
- 2026Scalable Circuit Learning for Interpreting Large Language Modelscited by 2
- 2025Constructive Circuit Amplification: Improving Math Reasoning in LLMs via Targeted Sub-Network Updatescited by 1
- 2026CIRCUS: Circuit Consensus under Uncertainty via Stability Ensemblescited by 1
Built on by
Not cited yet.