mlsanityData to 14 Oct 2026

The Key Handoff: Retrieval in Hybrid Language Models

arXiv 2609.32942 ↗First posted 26 Sep 2026cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

A two-hop question makes a language model retrieve twice: once to produce a bridge entity, and once to retrieve with it. Transformers resolve that entity in their early layers. Hybrid models replace most of the attention with a recurrent state, so where the key becomes usable, and where it is spent on an answer, is not known. Answering "Where is the ball?" from "the ball belongs to Alice" and "Alice is in the garden" turns on Alice, a name the question does not mention. A model could reach garden through Alice, the key it computed, or through where the fact sits in the prompt. Across twelve models, dense and hybrid, we move a hidden state from one story into another where the two routes lead to different places, and read off which place the model gives. An attention layer converts the key in every model we tested, and crossing that layer removes its usable effect, all of it where no attention follows. In sequential hybrids this makes the answer a handoff: recurrent layers carry the key forward, and attention spends it. Retrieval does not always stop there. Writing a different fact into the memory of the recurrent layers that follow the last attention layer can move the answer toward that fact, multiplying its odds by 1.3 to 2.7, and which hybrids do this is not settled by their architecture or training. That read is addressed by the key, not by position: recurrent state in a hybrid is not only a carrier, but a memory that later layers can query.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 31 references that are in the map. First posted on arXiv 26 Sep 2026.

Builds on

25 of 31 references.

References · 25

  1. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  2. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
  3. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,336
  4. 2023Large Language Modelscited by 780
  5. 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
  6. 2021Causal Abstractions of Neural Networkscited by 422
  7. 2024Retrieval Head Mechanistically Explains Long-Context Factualitycited by 232
  8. 2023Localizing Model Behavior with Path Patchingcited by 195
  9. 2024An Empirical Study of Mamba-based Language Modelscited by 186
  10. 2024Do Large Language Models Latently Perform Multi-Hop Reasoning?cited by 169
  11. 2023Does Circuit Analysis Interpretability Scale? Evidence from Multiple Choice Capabilities in Chinchillacited by 149
  12. 2023How do Language Models Bind Entities in Context?cited by 108
13 more
  1. 2025NVIDIA Nemotron Nano 2: An Accurate and Efficient Hybrid Mamba-Transformer Reasoning Modelcited by 108
  2. 2023Is This the Subspace You Are Looking for? An Interpretability Illusion for Subspace Activation Patchingcited by 80
  3. 2024Hopping Too Late: Exploring the Limitations of Large Language Models on Multi-Hop Queriescited by 78
  4. 2024Locating and Editing Factual Associations in Mambacited by 37
  5. 2024Answer, Assemble, Ace: Understanding How LMs Answer Multiple Choice Questionscited by 35
  6. 2025Mixing Mechanisms: How Language Models Retrieve Bound Entities In-Contextcited by 26
  7. 2025Mechanistic evaluation of Transformers and state space modelscited by 9
  8. 2025LLMs Process Lists With General Filter Headscited by 7
  9. 2025Addressing divergent representations from causal interventions on neural networkscited by 7
  10. 2024Investigating the Indirect Object Identification circuit in Mambacited by 5
  11. 2025Some Attention is All You Need for Retrievalcited by 3
  12. 2026What Attention Recalls and Recurrence Controls in Hybrid Language Modelscited by 2
  13. 2025Understanding In-Context Learning Beyond Transformers: An Investigation of State Space and Hybrid Architecturescited by 1

Built on by

Not cited yet.