mlsanityData to 7 Oct 2026

Look Before You Leap: A Universal Emergent Decomposition of Retrieval Tasks in Language Models

arXiv 2312.10091 ↗First posted 13 Dec 2023cs.IR cs.CL cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

When solving challenging problems, language models (LMs) are able to identify relevant information from long and complicated contexts. To study how LMs solve retrieval tasks in diverse situations, we introduce ORION, a collection of structured retrieval tasks spanning six domains, from text understanding to coding. Each task in ORION can be represented abstractly by a request (e.g. a question) that retrieves an attribute (e.g. the character name) from a context (e.g. a story). We apply causal analysis on 18 open-source language models with sizes ranging from 125 million to 70 billion parameters. We find that LMs internally decompose retrieval tasks in a modular way: middle layers at the last token position process the request, while late layers retrieve the correct entity from the context. After causally enforcing this decomposition, models are still able to solve the original task, preserving 70% of the original correct token probability in 98 of the 106 studied model-task pairs. We connect our macroscopic decomposition with a microscopic description by performing a fine-grained case study of a question-answering task on Pythia-2.8b. Building on our high-level understanding, we demonstrate a proof of concept application for scalable internal oversight of LMs to mitigate prompt-injection while requiring human supervision on only a single input. Our solution improves accuracy drastically (from 15.5% to 97.5% on Pythia-12b). This work presents evidence of a universal emergent modular processing of tasks across varied domains and models and is a pioneering effort in applying interpretability for scalable internal oversight of LMs.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 13 Dec 2023.

Builds on

25 of 35 references.

References · 25

  1. 2017Attention Is All You Needcited by 59,932
  2. 2022Training language models to follow instructions with human feedbackcited by 15,712
  3. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,768
  5. 2016Layer Normalizationcited by 5,579
  6. 2022Training a Helpful and Harmless Assistant with Reinforcement Learning from Human Feedbackcited by 3,634
  7. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  8. 2022Locating and Editing Factual Associations in GPTcited by 2,609
  9. 2023Sparks of Artificial General Intelligence: Early experiments with GPT-4cited by 2,579
  10. 2020GLU Variants Improve Transformercited by 1,724
  11. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,130
  12. 2023Progress measures for grokking via mechanistic interpretabilitycited by 822
13 more
  1. 2022Discovering Language Model Behaviors with Model-Written Evaluationscited by 805
  2. 2019Are Sixteen Heads Really Better than One?cited by 803
  3. 2023Dissecting Recall of Factual Associations in Auto-Regressive Language Modelscited by 512
  4. 2023Faith and Fate: Limits of Transformers on Compositionalitycited by 496
  5. 2021Causal Abstractions of Neural Networkscited by 401
  6. 2022The Alignment Problem from a Deep Learning Perspectivecited by 246
  7. 2023How does GPT-2 compute greater-than?: Interpreting mathematical abilities in a pre-trained language modelcited by 199
  8. 2023Causal Abstraction: A Theoretical Foundation for Mechanistic Interpretabilitycited by 194
  9. 2023Localizing Model Behavior with Path Patchingcited by 182
  10. 2023Does Circuit Analysis Interpretability Scale? Evidence from Multiple Choice Capabilities in Chinchillacited by 145
  11. 2023The Hydra Effect: Emergent Self-repair in Language Model Computationscited by 145
  12. 2023Interpretability at Scale: Identifying Causal Mechanisms in Alpacacited by 102
  13. 2023Discovering Variable Binding Circuitry with Desideratacited by 32

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 9; 2025: 7; 2026: 1.

17 papers.

Sort:

By area: