- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies what mechanism models with different internal reasoning (CoT, pause token, latent reasoning) use for multi-step reasoning, especially for OOD generalization. They use five model variants on one synthetic task and perform an extensive mechanistic study. They find that the bottleneck-latent models have the best generalization capabilities, possibly due to relying less on shortcuts.
Critical strengths
- The experimental setup is strong and the analysis is very detailed. I think the task is clearly related to the problem at hand, and the authors perform a very extensive study of the five models on this task. It's clear how the study progresses and what question the authors are investigating (due to subsection names), and its clear the study provides a very full understanding of the models and the task.
Critical weaknesses
My primary concerns are listed in the discussion section of the paper by the authors.
-
Lack of important baseline: looped transformer. The authors mention on lines 472-473: "One family that is commonly used but not included here is the looped transformer". Since goal of the paper is to study how different types of LLMs perform multi-step reasoning, the claim in the title about a "recurrent search algorithm for depth generalization", and the study itself analyzes different types of internal reasoning, the study seems incomplete without including looped transformers. Looped transformers are by definition recurrent (in depth), which seems very relevant when studying depth generalization. There are a number of works studying looped transformers in similar contexts (e.g. Saunshi et al. 2025 studying reasoning in looped transformer, showing an inductive bias towards reasoning and how they "implicitly generate latent thoughts", or Yang et al. 2024 learning learning algorithms, Fan et al. 2025 length generalization).
-
Generalizability of results. Currently, the study is performed at one mode scale on one synthetic task. The authors say the following: "However, the use of small models and a synthetic task limits how far the current conclusions can extend." I agree with this claim; currently, the scale of the study seems limited.
Some suggestions that would strengthen the paper and address my concerns:
a) Include a looped transformer in the study. The authors cite two looped transformers (Dehghani et al., 2019; Giannou et al., 2023), and recently there is also (Prairie et al. 2026, Jeddi et al. 2026, and many more). Any of these looped models or the ones mentioned in 1) would strengthen the study.
b) Utilize various scales of models instead of just one
c) Use more synthetic tasks OR include a component studying pretrained language models
Questions for authors
- Is there a reason the looped transformer was not included in the study? If I am misunderstanding a difficulty in comparing it to the models currently in the study, please clarify.
3 comments
I thank the reviewer for the changes and inclusion of looped transformer. I think my concerns around mostly b) but also c) still stand, so I will maintain my score.
Second round response
We thank the reviewer for recognizing that we have addressed the concern about the looped transformer.
We would like to further clarify the two remaining points.
For W2 and (c), we believe the new results do support our claim. Please let us further clarify this. The Full-latent model and CoT model are at comparable in-distribution accuracy, but the Full-latent model achieves about 20% higher OOD accuracy than CoT. The Bottleneck-latent model reaches OOD accuracy similar to CoT despite substantially lower in-distribution accuracy. Together, these results suggest that latent reasoning generalizes better than CoT models. We apologize that this was unclear.
Regarding the concern about the lack of experiments on larger models, we agree that the results can vary across model sizes and architectures. However, how results change with model size and architecture is a broad question that is actively studied in the field. We are sincerely sorry that we cannot cover all of these in this study.
But we do believe this work makes a significant contribution to the field. It demonstrates that latent models generalize better than CoT models, and it further identifies the underlying circuits in the bottleneck-latent models. We hope the reviewer can kindly improve the score to reflect the contribution of this work.
We thank the reviewer for the suggestions. We have prepared a revised version in which updated text is marked in cyan. The anonymized revised Introduction, Discussion and new Appendix can be viewed at https://images4.imgbox.com/f9/4a/SN2O8vgK_o.png, https://images4.imgbox.com/e4/18/QsAb8udI_o.png and https://images4.imgbox.com/42/bf/yuKKytzs_o.png.
W1, (a) and Q1: Looped Transformer We have added a looped Transformer test to the study (Appendix A.9) and revised the Introduction and Discussion ( see above).
Following 2502.17416, we use the same four-layer backbone and apply the two middle layers 6 times, with the same evaluation sets. The looped model has the same parameters as the other variants but uses more computation as it updates all positions in 14 layer passes, while latent models use 4 layer passes over the prompt and one new position per thinking step, so the looped model uses ~ x3 FLOPs. On the main OOD evaluation, the looped model reaches around 95%. Strong depth generalization is expected for the looped model, given its recurrence over depth and its larger computation. Second, it is not affected by the two degree manipulations. Third, when the candidates have child nodes (they are all leaf nodes in training), its performance drops and like CoT, it more often selects a child of the correct candidate, while the latent models are still the best. This suggests that with a fixed number of iterations and no explicit training on when to stop, the looped model does not develop a stopping mechanism automatically, but we haven't tested adaptive halting.
Q1 there is no difficulty in comparing its behavior, and we should have included it. We did not include it initially because our focus was on models that reason step by step over sequence positions, like CoT. We were especially interested in this because in the Coconut paper the variant trained without the curriculum is no better than the no-CoT baseline, and many follow-up studies use CoT compression or RL to get latent reasoning. We first found that Coconut-style latent reasoning can work without RL or extra guidance like CoT traces (Full-latent), and introduced Bottleneck-latent to decouple the intermediate computation from the question and study its mechanism. Looped Transformers recur over depth instead of over sequence positions, so we left them out. They are now included in the revised version.
The difficulty is only in the circuit analysis. Our method transplants the state between steps, which is a single vector in Bottleneck-latent but is spread over all positions in a looped model. So the circuit analysis stays on Bottleneck-latent, and how the looped model works internally needs newer methods, which we are exploring actively.
We think the new result supports the main point in a broader form. Both the looped model and our latent models do recurrent computation in latent space, over depth or over sequence positions, and both generalize to longer paths better than Direct, CoT and Pause, requiring no extra information like proof during training. The Discussion now says this, and the Introduction now discusses related looped transformer works mentioned.
W2 and (b): model scale We have not been able to run this in the rebuttal period. We plan to train a larger CoT and a larger Bottleneck-latent and test whether they still differ on OOD and on the degree tests, and will report it in the final version.
W2 and (c): more tasks or pretrained models We tested the models on another task, modulo-p (p=11) arithmetic (Appendix A.10). The results are preliminary. On the ID test set, CoT and Full-latent are the best (99.9% and 98.1%). On longer expressions all variants drop a lot, but Full-latent is still the best (36.6%, vs 23.4% for CoT and 21.1% for Direct; chance level is 9.1%). However, bottleneck-latent has not converged on this task under the same training budget. We are working on this (we think this is related to weak supervision signal as in this task only one token is used for answer and bottleneck latent has a a decoupled structure) and will update once finished.
We agree that showing the same effect with pretrained language models would be even better. Originally we tried GPT-2 as Coconut did, and Full-latent works better on ProsQA-Ext(not shown in the manuscript) than the direct variant. For the circuit analysis purpose and the consideration to eliminate potential interference from knowledge in pretraining, we later focused on the smaller architecture that works and trained everything from scratch.