mlsanityData to 14 Oct 2026

An explainable transformer circuit for compositional generalization

arXiv 2502.15801 ↗First posted 19 Feb 2025cs.LG cs.AI cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Compositional generalization-the systematic combination of known components into novel structures-remains a core challenge in cognitive science and machine learning. Although transformer-based large language models can exhibit strong performance on certain compositional tasks, the underlying mechanisms driving these abilities remain opaque, calling into question their interpretability. In this work, we identify and mechanistically interpret the circuit responsible for compositional induction in a compact transformer. Using causal ablations, we validate the circuit and formalize its operation using a program-like description. We further demonstrate that this mechanistic understanding enables precise activation edits to steer the model's behavior predictably. Our findings advance the understanding of complex behaviors in transformers and highlight such insights can provide a direct pathway for model control.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 21 of its 33 references that are in the map. First posted on arXiv 19 Feb 2025.

Builds on

21 of 33 references.

References · 21

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,592
  6. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
  7. 2022In-context Learning and Induction Headscited by 964
  8. 2023Progress measures for grokking via mechanistic interpretabilitycited by 839
  9. 2023Towards Automated Circuit Discovery for Mechanistic Interpretabilitycited by 724
  10. 2019Compositionality decomposed: how do neural networks generalise?cited by 265
  11. 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 202
  12. 2023Localizing Model Behavior with Path Patchingcited by 195
9 more
  1. 2024A Practical Review of Mechanistic Interpretability for Transformer-Based Language Modelscited by 118
  2. 2024Transformers, parallel computation, and logarithmic depthcited by 79
  3. 2024Finding Transformer Circuits with Edge Pruningcited by 60
  4. 2024Learning to grok: Emergence of in-context learning and skill composition in modular arithmetic taskscited by 40
  5. 2024Understanding the Expressive Power and Mechanisms of Transformer for Sequence Modelingcited by 25
  6. 2024Efficient Automated Circuit Discovery in Transformers using Contextual Decompositioncited by 23
  7. 2025Complexity Control Facilitates Reasoning-Based Compositional Generalization in Transformerscited by 20
  8. 2024Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursioncited by 14
  9. 2024How Transformers Get Rich: Approximation and Dynamics Analysiscited by 8

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 2.

8 papers.