mlsanityData to 14 Oct 2026

How does GPT-2 Predict Acronyms? Extracting and Understanding a Circuit via Mechanistic Interpretability

arXiv 2405.04156 ↗First posted 7 May 2024cs.LGcited by 14

On the map: Mechanistic interpretability → Circuits and mechanistic analysis

Abstract (arXiv)

Transformer-based language models are treated as black-boxes because of their large number of parameters and complex internal interactions, which is a serious safety concern. Mechanistic Interpretability (MI) intends to reverse-engineer neural network behaviors in terms of human-understandable components. In this work, we focus on understanding how GPT-2 Small performs the task of predicting three-letter acronyms. Previous works in the MI field have focused so far on tasks that predict a single token. To the best of our knowledge, this is the first work that tries to mechanistically understand a behavior involving the prediction of multiple consecutive tokens. We discover that the prediction is performed by a circuit composed of 8 attention heads (~5% of the total heads) which we classified in three groups according to their role. We also demonstrate that these heads concentrate the acronym prediction functionality. In addition, we mechanistically interpret the most relevant heads of the circuit and find out that they use positional information which is propagated via the causal mask mechanism. We expect this work to lay the foundation for understanding more complex behaviors involving multiple-token predictions.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Placed in Circuits and mechanistic analysis, one of 13 directions in Mechanistic interpretability. Builds on 11 of its 27 references that are in the map. First posted on arXiv 7 May 2024.

Builds on

11 of 27 references.

Closest ancestors · 2

Same direction, newest first

  1. 2023Progress measures for grokking via mechanistic interpretability12 Jan
  2. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small1 Nov

Other references · 9

  1. 2017Attention Is All You Needcited by 60,361
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2016Layer Normalizationcited by 5,669
  4. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  5. 2023Jailbroken: How Does LLM Safety Training Fail?cited by 1,651
  6. 2022Toy Models of Superpositioncited by 971
  7. 2023Multi-step Jailbreaking Privacy Attacks on ChatGPTcited by 333
  8. 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 202
  9. 2023Does Circuit Analysis Interpretability Scale? Evidence from Multiple Choice Capabilities in Chinchillacited by 149

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 5; 2025: 4; 2026: 5.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2024Adaptive Circuit Behavior and Generalization in Mechanistic Interpretability
  2. 2025Mechanistic Unveiling of Transformer Circuits: Self-Influence as a Key to Model Reasoning
  3. 2026Mechanistic Interpretability for Neural Networks: Circuits, Sparse Features and Symbolic Reasoning
  4. 2025Everything, Everywhere, All at Once: Is Mechanistic Interpretability Identifiable?
  5. 2026Rethinking Circuit Evaluation: Do Circuits Explain Model Errors?
  6. 2026Explaining the Explainer: Understanding the Inner Workings of Transformer-based Symbolic Regression Models
  7. 2025From Indirect Object Identification to Syllogisms: Exploring Binary Mechanisms in Transformer Circuits
  8. 2026Formal Mechanistic Interpretability: Automated Circuit Discovery with Provable Guarantees