- Rating
- 2(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper provides a study on how looped transformers generalize to longer reasoning changes than in training. They perform a mechanistic interpretability study of two types of architectures: MR-looped transformers (these have input reinjection) and DR-looped transformers (these embed the input once and have a variable number of iterations in training). Through the analysis, they identify distinct mechanisms for each approach, as well as some a representational principle.
Critical strengths
- Figure 1 and Figure 2 are clear, well-made figures that make the MR-loop and DR-loop methods very understandable.
- The three primary research questions are clear
Critical weaknesses
The paper is very difficult to follow because all the results figures are in the appendix. The main text contains Table 1 (task detals), Figure 1 (MR-loop vs DR-loop mechanism), Figure 2 (MR-loop vs DR-loop mechanism). All the experimental results figures are contained in the appendix, which makes the paper very difficult to read and understand. The main text repeatedly references appendix figures for results, meaning the main text does not contain the story. I will list a few claims from the paper that are in the appendix:
- Lines 187-191: "We identify two recurring attention patterns in the MR-loop transformer. The first is a traveling previous-token pattern: at loop t, the query at rt+2 attends strongly to rt+1, with this localized attention peak shifting along the sequence across successive loops (Figure 3 in Appendix C.1). The second is a fixed-query tracking pattern: the query remains at the [EQ] position (the answer readout position) while its attention shifts to rt+1 at loop t (Figure 4 in Appendix C.1). "
- Lines 198-203: " The attention patterns above suggest an iterative computation. We next investigate whether intermediate values are recoverable during this computation and where they are represented. At each loop t, we measure whether the highest-probability prediction at positions rt, rt+1, and [EQ] matches the ground-truth intermediate entity et+1. As shown in Figure 5 from Appendix C.2, predictions at [EQ] recover et+1 with perfect accuracy, whereas accuracy at rt and rt+1 remains low. "
- Lines 234-235: "The state-swap experiments in Appendix C.3 show that relation-token states causally influence which relation is selected."
- Lines 262-265: "As illustrated by the attention patterns in two representative heads in Figures 6 and 7 from Appendix E.1, a localized region of elevated attention progresses toward later sequence positions along the main diagonal and the first subdiagonal, corresponding to attention to the current and immediately preceding positions, respectively."
- Lines 453-455: "Composite-modulus polynomial tasks and FSC with non-bijective transitions can admit such compression, whereas prime-modulus polynomial tasks, fully bijective FSC, and our permutation-based KG construction preserve state distinctions (Appendix H)."
There are more examples in the different sections. As it stands, without any results tables or figures in the main text, the main text does not contain evidence for the full story the authors are telling.
This is my primary concern, and it can be addressed by reorganizing the paper so that there are figures in the main text.
Questions for authors
Are the mechanisms identified for MR-loop and DR-loop specific to looped models? I am curious how a non-looped / weight-untied model with matched depth would compare.
7 comments
Question: Are the mechanisms specific to looped models?
Question: Are the mechanisms identified for MR-loop and DR-loop specific to looped models? I am curious how a non-looped / weight-untied model with matched depth would compare.
We thank the reviewer for this question, which has two parts.
Beyond the training horizon. Standard transformers often fail to generalize beyond their training length (Anil et al., 2022; Delétang et al., 2023; Kazemnejad et al., 2023) or to reasoning depths beyond those seen in training (Kohli et al., 2026); for implicit multi-hop reasoning over parametric knowledge, the number of layers required grows linearly with the number of hops (Yao et al., 2025). Looped transformers can instead extend computation by adding iterations at test time (Fan et al., 2025; Kohli et al., 2026). The beyond-horizon behavior of both mechanisms depends on weight sharing across depth by construction: the same parameters are reapplied for additional loops, including at positions never reached during training. A fixed-depth untied model has no additional iterations to apply at test time, so this part of the mechanism cannot arise in such a model. (Such a model might still handle longer inputs by other means, e.g., log-depth algorithms (Sanford et al., 2024), but not by reapplying the same update.)
Within the training distribution. An untied model of matched effective depth could in principle represent the in-distribution computation, although learning it may require substantially more data (Yao et al., 2025). Prior work suggests such a model would organize multi-hop computation by depth: untied transformers resolve intermediate entities layer by layer (Yao et al., 2025), and in a 2-hop setting, a logit-lens comparison with an untied model of matched effective depth shows that it decodes the bridge entity but fails to complete the second hop on facts never seen in compositions during training, where the looped model succeeds (Kohli et al., 2026). The key difference is what weight sharing forces. In a looped model, the same parameters implement the update at every iteration, so the operations we identify (MR-Loop's traveling previous-token and fixed-query tracking patterns, and DR-Loop's local composition at the advancing frontier) are implemented by the same weights at every iteration. This reuse is what makes it possible to apply them at loops never seen in training, although their reliability degrades at extreme lengths (Sec. 5). An untied model faces no such constraint: each layer can implement a hop-specific circuit, and nothing in the architecture requires these circuits to be shared across layers. We therefore expect that what is specific to looped models is the reuse of a single update across iterations, rather than any particular in-distribution circuit; testing this directly requires the comparison the reviewer suggests, which is a valuable furture direction that we can note in the Discussion.
Refered Paper:
Anil et al. (2022). Exploring Length Generalization in Large Language Models.
Fan, Du, Ramchandran & Lee (2025). Looped Transformers for Length Generalization.
Kohli, Parthasarathy, Sun & Yao (2026). Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers.
Delétang et al. (2023). Neural Networks and the Chomsky Hierarchy.
Kazemnejad, Padhi, Natesan Ramamurthy, Das & Reddy (2023). The Impact of Positional Encoding on Length Generalization in Transformers.
Yao, Du, Zhu, Hahn & Koller (2025). Language Models Can Learn Implicit Multi-Hop Reasoning, but Only If They Have Lots of Training Data.
Sanford, Hsu & Telgarsky (2024). Transformers, Parallel Computation, and Logarithmic Depth.
Follow-up: Revised PDF uploaded with added figures and tables in main text
Follow-up: revised PDF uploaded
We have uploaded the revised PDF; all changes are highlighted in blue. As the reviewer suggested, we reorganized the paper so that the main text contains more result figures and tables supporting its claims: three result figures (Figures 1, 3, 4) and three result tables (Tables 2–4).
Passages quoted in the review
| Passage in the review | Location in the revision |
|---|---|
| L187–191: MR-Loop attention patterns | Figure 1 (Sec. 4.1): L0H1 traveling previous-token attention and L2H0 fixed-query tracking at passes t ∈ {1, 2, 12}, with the attended relation advancing past the last training relation r₁₁; full recurrences in Figures 6–7 (App. C.1) |
| L198–203: intermediate decoding at [EQ] | Figure 3a (Sec. 4.1) |
| L234–235: state-swap experiments | Sec. 4.1 now reports the state-swap results directly (100% counterfactual accuracy within the training range and 91.5–93.1% beyond it for relation-token swaps; 95.2% at the unseen hop k = 14 for [EQ] swaps), and Table 2 reports the live–consumed interventions within and beyond the training horizon |
| L262–265: DR-Loop attention patterns | Figure 4 (Sec. 4.2): L1H1 and L0H0 attention bands advancing past r₁₁; full recurrences in Figures 9–10 (App. E.1) |
| L453–455: compressive vs. information-preserving tasks | Table 4 (Sec. 6): length-generalization success by task structure, with each setting marked as compressive or not; full results in Table 7 (App. I.1) |
Other additions
- Figure 3b (Sec. 4.2): logit-lens view of DR-Loop's advancing intermediate-state frontier, including entities beyond the training depth.
- Table 3 (Sec. 4.3): fresh–aged interventions for DR-Loop, within and beyond the training horizon.
- Sec. 4.3 rewritten to connect both models' computational-status results to Tables 2–3 and Figure 5.
These changes use the additional page allowed during discussion and a more concise Section 4.3; no results were removed.
Since the reviewer indicated that this reorganization would address the primary concern, we hope the revised version does so, and we would be grateful if the reviewer would consider updating their assessment. We are happy to make further adjustments if anything else would help.
Weakness regarding presentation: Result figures placed in Appendix
We thank the reviewer for the careful reading, and for stating that the primary concern "can be addressed by reorganizing the paper so that there are figures in the main text." We are currently working on this reorganization. We will upload the revised PDF around November 17 (AoE), and post a follow-up listing every change.
1. Presentation: result figures will move into the main text
We agree that the submitted version relied too heavily on the appendix for figures. Our reason was the volume of evidence: for two looped configurations across three task families, the claims rest on attention analyses, logit-lens decoding, causal interventions with random-direction controls, extreme-length analyses, and replications across tasks and independently trained models. Within the 9-page limit, we reported the quantitative results and controls in the text and placed the visualizations in the appendix.
Using the additional page allowed during discussion, we will reorganize the paper and move some of the most important figures into the main text.
2. On whether the main text contained the evidence
We would like to clarify one point. The submitted main text lacked result figures, but not results: the key quantitative findings and their controls were reported in the text, for example: