- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies how oscillatory latent dynamics affect convergence in recurrent reasoning models. A local spectral analysis shows that a slowly decaying oscillatory mode can impose its convergence rate on complementary latent coordinates. Controlled interventions in FPRM and HRM test these predictions, while early suppression experiments demonstrate that oscillations can remain computationally useful. The proposed Quotient Recurrent Reasoner (QRR) introduces token-local phase symmetry, equivariant updates, and invariant readouts, enabling convergence and halting in quotient space. Validation includes spectral analyses, architectural ablations, and accuracy, halting, and runtime comparisons on Sudoku, two maze benchmarks, and Mini-ARC. The paper presents a coherent and reasonably comprehensive study connecting theoretical analysis, architectural design, and empirical validation.
Critical strengths
-
Section 3 produces explicit intervention-response predictions without fitting subsequent trajectories. Testing these predictions in the original nonlinear FPRM and HRM recurrences, across alternating and spiral dynamics, provides quantitative evidence that the identified modes affect local convergence. The early-versus-late suppression experiment further demonstrates why oscillatory motion should not be treated as uniformly dispensable.
-
QRR structurally ensures that the ignored phase motion does not affect predictions or future quotient states, providing a principled basis for quotient-based halting. Results on Maze-Unique and Mini-ARC provide additional support beyond the main benchmark.
Critical weaknesses
-
Section 3 establishes a local mechanism in existing models, while QRR’s symmetry guarantees only that gauge motion cannot drive quotient dynamics. Why training yields a faster quotient spectrum remains an empirical question.
-
Table 1 combines different checkpoint sources and native inference budgets, with a substantial gap between official and reproduced FPRM Sudoku accuracy (91.5% versus 83.7%). Halting statistics also condition on different coverage.
Questions for authors
Overall, I have no major concerns about the paper and would appreciate clarification on the following experimental details:
-
Which FPRM checkpoints and evaluation settings are used in Tables 1–2 and the runtime comparison? What explains the gap between official-checkpoint and reproduced Sudoku results?
-
How were halting thresholds calibrated, and were runtime statistics measured over all test examples, including those reaching the cap? Can accuracy–coverage–runtime comparisons be provided under explicitly matched evaluation conditions?
3 comments
Thank you for the additional experiments and clarifications, which substantially alleviate my main concerns. It would be helpful to report overall test accuracy, including cap-reached instances, and specify which FPRM checkpoint was used for the runtime comparison. I encourage the authors to include these details in the main results table or its caption.
Thank you for recognizing our efforts to address your concerns and for your constructive feedback. We will include the overall test accuracy, including cap-reached instances, and clarify the FPRM checkpoint used for the runtime comparison in the revised manuscript.
Response to Reviewer tDyW
We thank the reviewer for recognizing QRR’s contributions and for providing constructive feedback that has helped us improve our work. We address each point below.
1. Structural symmetry versus learned convergence speed (W1)
We thank the reviewer for raising this key distinction. We agree that gauge equivariance guarantees decoupling from slow gauge motion, but does not by itself guarantee a faster learned quotient spectrum. As an empirical verification, we trained a symmetry-breaking control on Sudoku-Extreme by introducing a non-gauge perturbation to the G-SwiGLU value branch.
As shown in Figure 11 in Appendix A.4 in revised manuscript, symmetry breaking substantially changes the learned dynamics and spectral structure. The leading transverse spectral rate increases from 0.989 to 1.283, shifting from contracting to expanding dynamics. Meanwhile, gauge-to-quotient coupling (Proposition A.2 in Appendix) increases from numerical zero to 0.16. Consequently, 89/96 QRR trajectories settle, whereas none of the 96 control trajectories do. Despite achieving 90.6% full-cap accuracy (which is comparable to our FPRM reproduction), the symmetry-breaking control fails to halt under either QRR's native gauge-aligned residual criterion or FPRM's full latent residual criterion (this is mainly because, unlike FPRM, the control has no explicit adaptive damping controller). These results provide empirical evidence that QRR's gauge-equivariant architecture actually affects the learned spectrum of quotient dynamics, beyond enabling quotient-based halting.
2. Baseline results and reproducibility (W2 / Q1)
We thank the reviewer for highlighting this omission. We now added Appendix A.6 (Baseline Setup) in the revised manuscript, documenting task-specific training and inference configurations for all baselines.
We additionally conducted 3-seed reproducibility checks on Sudoku-Extreme. We identified a configuration mismatch in our initial FPRM reproduction (83.7%). We used non-official FPOPT decay/patience settings (0.99/5 instead of 0.997/10 in official setup). We corrected this mismatch and repeated full training following the official setup, obtaining 88.50% on average (now updated in Table 1 in revised version). Both released and reproduced checkpoints were evaluated using the same protocol, with a rollout cap of 35,000, residual threshold of 0.1, FPOPT decay/patience of 0.997/10, and minimum step size of 10−3.
3. Halting calibration, coverage, and runtime under matched setup (W2 / Q2)
We thank the reviewer for pointing out the missing threshold calibration protocol and runtime analysis details. We clarify how halting thresholds are calibrated and report full accuracy-coverage-runtime comparisons under matched conditions, including instances that reach the rollout cap.
Halting threshold calibration. For each trained model, we perform full-cap inference rollouts on a randomly held-out 10% of training examples and select the threshold that enables the earliest halting while keeping accuracy within a predefined margin of the full-cap accuracy.
Runtime comparison under matched conditions. The runtime comparison in Table 1(b) did not include cap-reached examples. Here, we provide a full accuracy-coverage-runtime comparison, both for halted instances and for all instances, including those reaching the rollout cap. Except for halting criteria, both models are evaluated on the same 4,228 held-out set of Sudoku-Extreme, with the same seed, maximum depth (35k steps), GPU (A100-40GB), and batch size (256). As a result, QRR achieves higher accuracy, substantially fewer false halts, and lower runtime under matched conditions.