- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LoLa, a framework for latent reasoning tuning with a recurrent refinement mechanism. A lightweight latent reasoner is looped with the frozen base LLM: the latent tokens are passed through the LLM, and the LLM’s hidden states are fed back to update the reasoner’s latent state. The final latent tokens condition the answer generation. The reasoner is trained with SFT followed by GRPO. Since the LLM backbone is frozen, LoLa can perform latent reasoning without modifying the target reasoning LLM. Experiments on DeepSeek-R1-Distill-Qwen-1.5B and Qwen3-4B show that it outperforms LRT.
Critical strengths
-
The idea is clear and has the potential for enhancing and extending the mainstream latent reasoning LLMs.
-
The method is modular and easy to implement. The base LLM is untouched, so explicit CoT is still available.
-
It achieves better performance than LRT on both backbones.
-
The paper is clearly written, and the appendix gives enough details of the architecture and training.
Critical weaknesses
-
Almost everything in this paper is adopted from LRT except the recurrent mechanism, including the reasoning network, the learnable reasoning tokens, the training pipeline and the evaluation protocol. The novelty is therefore limited, and the feedback from the base LLM only brings about 2 points in the ablation (Table 3).
-
The comparison across loop depths is unfair. As stated in Appendix B, LoLa is trained with T=4, but it is evaluated with different depths, which are out of distribution for the trained model. So the gain from T=1 to T=2 in Table 5 does not show the benefit of recurrence.
-
The performance of LoLa (T=1) on Qwen3-4B is even worse than LRT.
Questions for authors
Why is LoLa (T=1) much worse than LRT, even though it is the closest to a single-pass reasoner?
Depth-matched training and evaluation
We sincerely thank the reviewer for the thoughtful and constructive comments, and for recognizing LoLa’s potential and modular design. We appreciate the concerns regarding its methodological contribution and the comparison across loop depths. To address these points, we conduct additional controlled training experiments.
1. Methodological contribution.
Unlike LRT, which generates latent representations in a single forward pass, LoLa introduces iterative interaction between the latent Reasoner and the frozen base LLM. At each iteration, the current latent thought is processed by the base LLM, and its hidden states are projected into feedback memory and integrated by the reasoner through gated cross-attention to update the latent state. KV-cache reuse avoids recomputing prompt representations across iterations. This enables iterative latent refinement without modifying the base LLM or requiring recurrent pretraining. In the original feedback ablation, this mechanism improves average accuracy by 2.05 percentage points across five benchmarks, with gains on all five.
2. Depth-matched training and evaluation.
In the original experiments, Table 5 evaluates the same trained model at different inference depths. Its T=1 result does not represent an independently trained single-update model.
To address this issue, we independently train LoLa-1U, which performs one reasoner update throughout both SFT and GRPO. We also retrain LRT using its original single-pass architecture. All three models use the same frozen Qwen3-4B backbone, training data, random seeds, effective batch size, and training recipe: two SFT epochs (learning rate 1e-4), followed by 50 GRPO updates (learning rate 3e-5). Full LoLa uses T=4 during SFT and T=3 during GRPO and inference.
Before GRPO, the SFT-only Pass@1 scores are 44.55% for LRT, 44.62% for LoLa-1U, and 51.83% for LoLa.
Pass@1 and Pass@4 on Qwen3-4B (%).
Under matched SFT+GRPO, LoLa-1U improves over LRT by 0.40 and 1.09 percentage points in average Pass@1 and Pass@4, respectively. Full LoLa further improves over LoLa-1U by 1.58 and 2.41 points, respectively.
These results clarify the original T=1 comparison: independently training a single-update LoLa model yields better performance than LRT, while iterative refinement further improves both Pass@1 and Pass@4.
We sincerely thank the reviewer again for these valuable suggestions. They motivate us to conduct additional controlled training experiments and clarify the depth-matched comparison. We hope these results address the reviewer’s concerns and provide a clearer understanding of LoLa’s contribution. We will incorporate these results and analyses into the revised manuscript.