- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies recurrent updates that initially increase reference utility but reduce it when applied in full. Using teacher-forced interpolation along the model’s proposed displacement, the authors distinguish finite-step failures from locally unhelpful directions. Local derivatives and curvature predict utility changes and useful step scales, while contraction experiments show that intermediate states can outperform both original endpoints. Experiments across Ouro and Huginn provide convincing evidence for this distinction under immediate reference-conditioned readout. The main limitations concern its implications for subsequent recurrence and generation, the reference dependence of adaptive scale selection, and the narrower validation of scale prediction for Huginn.
Critical strengths
-
Separating update direction from step size gives a clear and useful account of why a harmful endpoint need not imply an unhelpful direction. The curvature analysis connects this distinction to testable predictions about intermediate states.
-
The experiments cover two model families and multiple tasks, with comparisons against common state- and output-change diagnostics. The full-test-set Ouro/GSM8K intervention is particularly helpful: quadratic selection recovers positive reference-utility gains for 425 of 429 finite-step failures, compared with 302 for a quarter step.
Critical weaknesses
-
The connection between immediate reference-utility recovery and actual generation remains uncertain. Intervened states are read out before further recurrence, so the experiments do not establish whether the benefit survives later updates or improves final answer accuracy. The authors clearly acknowledge this scope. Their HellaSwag example, where utility decreases while option accuracy increases, also shows why the two outcomes should remain distinct.
-
Adaptive scale selection requires derivatives of reference utility. Its advantage over fixed scales therefore measures the value of per-example adaptation when reference information is available. The paper proposes using this geometry as offline supervision for inference-time decisions, but the evidence does not yet show how accurately useful scales can be selected without the reference.
-
The Huginn scale-prediction results in Table 2 use a subset of the same 256 GSM8K training questions used to select the transition. The paper provides full-test-set mechanism analysis for Huginn and additional test-set intervention results for Ouro, so this is not a general absence of held-out evaluation. However, Huginn’s scale-prediction accuracy and recovery gains still need validation beyond the transition-selection subset.
Questions for authors
-
As a preliminary extension, could the authors test a fixed damping factor during free-running generation and compare final accuracy under matched computation budgets? This would help assess the practical implications of the immediate utility gains.
-
The paper already reports a held-out GSM8K mechanism analysis with the transition fixed, but the scale-prediction and contraction/recovery results for Huginn use the 256-question training cohort. Could these analyses also be evaluated on the held-out GSM8K test set using the same pre-specified transition and a matched initialization protocol?
5 comments
Thank you for the detailed responses and additional experiments. The results strengthen the paper and address some of my concerns. However, I have two questions:
-
In the free-running generation experiment, the overall numerical-answer accuracy improvement is quite modest. Could the authors provide a more detailed analysis about this?
-
Since reference-conditioned scale selection remains an important limitation, could the authors further clarify how the proposed local geometric insights could be translated into a practical reference-free scale prediction strategy?
Thank you for recognising that the additional results strengthen the paper.
1. More detailed analysis of the modest generation improvement.
Thank you for suggesting a closer analysis. The small net gain reflects corrections that are almost offset by new errors. The quarter step corrected six answers and made five previously correct answers wrong, changing the score from 52/128 to 53/128.
We compared the generated solutions to understand these changes. In one GSM8K question, the quarter step corrected the answer by using division instead of multiplication. In another, it introduced an arithmetic error. We used the same factor of 1/4 for the final recurrent update of every generated token. The six corrections show that changing step scale can improve individual generated answers at the same recurrent depth. This gives a practical reason to ask which updates benefit from shortening and by how much. Our geometric analysis addresses this question for reference utility by identifying useful shorter steps within harmful updates and predicting their scales (revised 3.3 and 4.4).
2. Translating the geometry into reference-free scale prediction.
Thank you for raising this question. We found that some harmful updates improve reference utility when shortened, and local geometry helps identify useful scales. A natural way to use this finding is to train a scale predictor with those scales as labels. We would use reference answers to compute the training labels. During generation, the predictor would choose a scale using only the hidden state, the computed update and the loop depth.
For example, Ouro's exit gate decides whether to stop or continue with another complete loop [1]. In its second-stage training, a full loop receives a zero-improvement signal if it increases the next-token loss. Scale labels could indicate whether a shorter step would still lower that loss. Under teacher forcing on the GSM8K test set, quadratic selection recovered reference utility for 100 of 102 finite-step failures in Huginn. A quarter step recovered 71 (revised 4.4).
During Ouro pretraining, the correct next tokens are already available. We could use local geometry to propose a shorter step and compare its next-token loss with that of the full step. If shortening lowers the loss, the shorter scale would be the training target. Otherwise, we would keep the full step as the target. Think-at-Hard already trains a decider from reference-based labels and uses hidden states at inference [2]. LoopFormer trains updates conditioned on step size [3], and LoopUS learns update gates [4]. These methods provide examples of learning when to continue or how to apply an update. Our geometric analysis adds scale labels based on which harmful updates still contain useful shorter steps. Ouro could use these labels during pretraining to learn when and how much to shorten an update, with the aim of lowering next-token loss at the same loop depth.
We hope the added analysis and training plan address your questions. We would be grateful if you could consider raising your rating.
[1] Scaling Latent Reasoning via Looped Language Models. ByteDance, 2025
[2] Think-at-Hard: Dynamic Looped Transformers for Improved Reasoning. PMLR 2026
[3] LoopFormer: Elastic-Depth Looped Transformers for Latent Reasoning via Shortcut Modulation. ICLR 2026
[4] LoopUS: Recasting Pretrained LLMs into Looped Latent Refinement Models.
Follow-up on Our Responses and Revised Manuscript
Thank you again for your constructive suggestions. We have added the held-out Huginn evaluation and the continuation and generation experiments discussed in our response. Could you kindly review our responses and revised manuscript?
We hope this additional evidence addresses your concerns and would appreciate your updated assessment.