Cross-Loop Query Handoff: How Later Loops Redirect Two-Hop Retrieval in the Ouro Looped Language Models

Ziyu Mu, Zehua WangarXiv 2026 · arXiv

TL;DR

Researchers have discovered that "looped" language models (which process the same input multiple times) repair multi-hop reasoning errors primarily by refining their attention queries in later passes. By transplanting these "mature" queries from a later loop back into the first, they can "rescue" nearly all failed retrievals, effectively handing off a refined search instruction that points the model toward the correct intermediate "bridge" entity.

What Problem Does This Paper Address?

Standard Large Language Models (LLMs) often struggle with multi-hop reasoning—tasks where you must combine two separate facts (e.g., "Bob has Box D" and "Box D is blue" to answer "What color is Bob's box?"). Even if the model "knows" both facts, it often fails to compose them.

"Looped" models, like the Ouro family, attempt to solve this by passing the hidden states through the same stack of layers multiple times (loops). While we know these models get better with more loops, we haven't understood how the mechanism works. Does the model build a better internal memory of the facts, or does it simply learn to "ask" better questions of its own attention mechanism? This paper investigates whether there is a specific "handoff" of information between loops that enables successful two-hop retrieval.

Methods

The authors use a technique called Query Transplantation to probe the Ouro-1.4B and Ouro-2.6B models.

  1. The Intervention: They take the attention queries ($Q$) computed at the final prompt position in a successful later loop (Loop 3) and inject them into the first loop (Loop 1) at the exact same layer and head.
  2. Crossed Swaps: To see if the transplanted query carries the answer or just a search instruction, they perform "crossed swaps." They take a query from a "donor" prompt (e.g., about Bob) and inject it into a "recipient" prompt (e.g., about Alice). If the model then looks for Bob's box in Alice's story, the query is carrying a "bridge-conditioned" instruction.
  3. Freezing: They "freeze" specific components (queries, keys, or values) at their Loop-1 states during subsequent loops to measure which updates are essential for the model's improvement (the "loop gain").

Datasets

  • Synthetic In-Context Two-Hop: A custom-built dataset of "scenes" involving four people, four boxes, and four colors linked by random bijections. This provides a clean environment to test "person $\rightarrow$ box $\rightarrow$ color" retrieval.
  • Natural QA: The authors also test the primary findings on more complex, real-world multi-hop questions from 2WikiMultiHopQA and MuSiQue, formatted for the model's chat interface.

Key Insights and Ideas

  • The Query is the Key: The improvement in multi-hop reasoning is driven by updates to the queries at the answer position. Injecting Loop-3 queries into Loop-1 "rescues" the model's performance, whereas injecting late keys or values (the "memory" of the facts) is significantly less effective.
  • Bridge Redirection: The transplanted queries don't just "cheat" by carrying the final answer. Instead, they carry a refined instruction to find the "bridge" entity (the box). In crossed swaps, the model consistently tries to find the donor's bridge entity within the recipient's context.
  • Asymmetry of Information: There is a clear asymmetry between the query (what to look for) and the keys/values (where to look and what is there). The model's "thinking" across loops seems to be a process of refining the search query rather than just clarifying the stored facts.
  • Model Size Matters: The "rescue" effect is much stronger and more robust in the larger Ouro-2.6B model than in the 1.4B version, especially when moving from synthetic to natural language tasks.

Key Results

  • High Rescue Rates: In synthetic tests, injecting Loop-3 queries into Loop-1 rescued 89.8% (1.4B) and 96.9% (2.6B) of questions that the model originally got wrong in the first loop but right in the third.
Figure 1: Rescue rates on two-hop targets (wrong at loop 1, right at loop 3), read at the loop-1 exit. (a) Rescue round: the same example’s loop-3 query at q, another target’s loop-3 query (shuffled donor), and another example’s loop-1 query (same-loop donor). (b) Converse round (Section 5.1; different scenes): the late query and the late keys and values of F, each from the same example or from a shuffled donor, and the same example’s late keys and values at every position except q; the key–value arms leave queries unpatched. Dashed line: chance (25%). Intervals are in Tables 2 and 4; the same-loop donor and same-example late K, V of F rates are point estimates.
  • Selective Damage: Freezing the query at its Loop-1 value completely destroyed the "loop gain," pushing accuracy back down to (or below) Loop-1 levels.
  • Redirection vs. Copying: In crossed swaps, the model followed the donor's bridge entity 45-48% of the time, while only copying the donor's final answer 8-13% of the time. This confirms the query acts as a transferable retrieval instruction.
Table 3: Two-hop query swaps (600 new scenes per model): the donor’s loop-3 query at q, all layers and heads, patched into the recipient at loop r. Shares of predictions (%) equal to each of four pairwise-different colors: the recipient’s answer (Rec.), the recipient’s color for the donor’s bridge box (Bridge), the donor’s answer (Ans.), and the recipient’s color at the line position of the donor’s answer (Line); chance 25%. 95% intervals for the bridge share.

Limitations and Future Work

  • The "Where" remains a mystery: While the paper shows that the query carries the handoff, it doesn't identify where in the model the bridge entity is actually resolved or how that resolution is transformed into the refined query.
  • Natural Language Gap: The "bridge redirection" effect seen in synthetic data did not replicate clearly on natural language datasets (2WikiMultiHopQA/MuSiQue). On natural text, the rescue was smaller and less specific to the donor item.
  • Architecture Specificity: The results are specific to the Ouro "looped" architecture. It remains to be seen if standard "deep" transformers (non-looped) use a similar query-refinement strategy across their layers.
  • Single Vector vs. Collection: The study uses a "layer-indexed collection" of queries. Future work could investigate if a single, compressed vector could achieve the same handoff.

Summary updated

Abstract

How do later loops in a pretrained looped language model repair two-hop retrieval? We study Ouro-1.4B and Ouro-2.6B by transplanting attention queries between loops at the same layer, head and final prompt position. On synthetic in-context questions, injecting the layer-indexed collection of loop-3 queries throughout loop 1 rescues 90% and 97% of questions answered incorrectly at loop 1 and correctly at loop 3, versus 24% and 21% for shuffled donors. The rescue also holds under greedy generation in Ouro-2.6B; in Ouro-1.4B it is limited to four-candidate ranking. Crossed donor-recipient swaps favor retrieval through the donor's bridge entity over copying its answer, although a substantial positional component remains in Ouro-2.6B. Late keys and values rescue far fewer targets. Freezing queries at their loop-1 values also damages two-hop accuracy more than a matched question that supplies the bridge. On natural questions, rescue is smaller and replicates only in Ouro-2.6B, and crossed swaps do not establish bridge redirection. These results identify a transferable collection of late-loop queries that supports bridge-conditioned retrieval on synthetic scenes; they do not locate where the bridge is computed or establish a single-vector handoff.
BibTeX
@misc{mu2026cross,
  author = {Ziyu Mu and Zehua Wang},
  title = {{Cross-Loop Query Handoff: How Later Loops Redirect Two-Hop Retrieval in the Ouro Looped Language Models}},
  year = {2026},
  eprint = {2610.34639},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.34639},
}
Figure