- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper investigates how additional recurrent computation affects evidence use in looped language models. It evaluates multiple model families on hundreds of synthetic graph instances and question pairs derived from two multi-hop QA benchmarks, supplemented by 64 controlled training runs.
Critical strengths
Interesting perspective on looped architectures. The paper examines the relatively underexplored relationship between recurrent computation and evidence use, offering novel and interesting observations on the behavior of looped language models.
Critical weaknesses
-
Limited mechanistic explanation. The paper primarily documents observed phenomena, with limited mechanistic explanation or targeted experiments to account for differences across models.
-
Fragmented presentation. Quantitative findings are scattered across figures and appendices, with insufficient synthesis in the main narrative, making the overall evidence difficult to assess.
Questions for authors
Please find the weakness above.
Follow-up on explanation and presentation
Dear Reviewer,
Thank you again for your feedback. Our revision now strengthens both the explanation and its presentation:
Since that revision, our November 14 follow-up also reports K1→K8 divergence in Qwen on 288 fresh worlds, extending the evidence beyond Phi-4.
We would welcome your assessment of these revisions.