- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
Recent papers have proposed recurrent models with the ability of leveraging more recurrent steps at inference than used during training to improve task performance. This paper highlights that when these models output an incorrect answer, it may be because the model has not carried out enough recurrent steps yet or it has entered a regime where it is persistently incorrect. To gain more insight into how these models work, the authors study the hidden state dynamics. They show that the accuracy increases when the recurrent steps are increased, and they perform various analyses, such as showing that the latent settling aligns with computational completion and that the completed computation is directionally stable.
Critical strengths
The paper does a good job of describing the analysis and the paper is clear and easy to follow. The plots are particularly nice, and the alignment plots in Figure 2 really help emphasize that early and late solvers share similar trajectories once aligned.
Critical weaknesses
My main concern is with the impactfulness of this paper. In particular, I believe some of the results are already known and the authors struggle to motivate the novel analysis.
The paper highlights that more recurrent steps can improve the performance of recurrent models like the TRM. This is already known, for example in [1], where they show increasing the number of recurrent steps improves performance in Sudoku, albeit they only increase from 16 to 48 recurrent steps and not 512 as is done here. Similarly, both [1] and [2] also acknowledge the existence of trajectories where there is quick success, delayed success and failure, similar to this paper's definition of early, late and persistent trajectories. Additionally, the analysis in Section 3.2 is similar to the analysis of the latents in [1] figure 2, which already suggests that there is a large reorganization at the puzzle solving step, followed by much less movement.
It is not clear to me how the novel findings, such as the finding that the trajectories are locally contracting along their direction of motion will have an impact in the field or for improving recurrent models. The authors do a good job describing the analysis, but struggle to provide a concrete motivation for doing so, with the short discussion and conclusion sections not clearly describing avenues for follow up work.
A minor weakness is that the authors use a very limited number of model weights in their analysis.
[1] Probabilistic Tiny Recursive Model, Sghaier et al., 2026
[2] Are Your Reasoning Models Reasoning or Guessing? A Mechanistic Analysis of Hierarchical Reasoning Models, Ren and Lie, 2026
Questions for authors
What do the authors see as the main motivation for studying aspects like the directional stability of trajectories? How is understanding these dynamics useful for improving recurrent models?
A clear answer here would affect my assessment.
3 comments
Thank you for the timely response.
Regarding the usefulness of analyzing the directional stability of trajectories, the authors propose to use targeted kicks to the states using the recurrent Jacobian. The authors claim that these target kicks can rescue 10 to 18% of persistently unsolved puzzles, although this also disrupts ~8% of correct solutions. The authors then suggest that this intervention should only be applied when we know the model has reached an incorrect solution. While this suggestion is sensible, I do believe it limits the applicability of this method, as there are many cases where the correct solution may not be known or verifiable at test time.
While I am still not fully convinced of the novelty of this work, the authors have however provided a way in which this method can be used for allocating compute and I am therefore inclined to raise my score.
Thanks for pointing this out. In our test, a targeted perturbation of 3% of the state norm recovered the correct answer in 10 of 62 cases where an Attention model had settled on a wrong answer.
Among the PERSISTENT unsolved puzzles, 62 (14 in Attention-A and 48 in Attention-B) settle on an incorrect board. Targeted kicks,
s~t=st±α∥st∥v1,∥v1∥=1,
using the leading right singular vector of the recurrence Jacobian, rescue 6–11 puzzles (10–18%) at every tested strength (new Figure 15c). At α=0.03, they reach an exact solution within 96 updates in 10/62 cases, compared with 0/62 for random kicks of equal size. Random kicks solve none at α≤0.03, showing that direction matters at small strengths. At α=0.3, rescue rates are 18% for v1, 6% for isotropic random kicks and 13% for random kicks restricted to ZH. These interventions also carry a cost: kicks disrupt 2 of 24 completed attention states, though none in the MLP. This motivates applying them only to settled states having a wrong solution.
The choice of direction distinguishes this result from [1, 2]. While [2] shows that arbitrary latent perturbations can destabilize dynamics, [1] explores inference-time diversity through isotropic Gaussian noise across 100 rollouts. Its directed alternative uses Langevin sampling guided by the gradient of an energy defined through the Q-head. Removing this gradient while keeping the noise gives essentially the same accuracy [1, App. F], indicating no measurable benefit from that direction. Both comparisons isolate the value of direction: [1] finds no benefit from the Q-head gradient, whereas our experiment finds a benefit from a direction derived from the recurrence Jacobian.
Our EARLY/LATE/PERSISTENT groups correspond to the trajectory modes in [1, 2], but we define them operationally for all 1,000 puzzles and align trajectories to their completion time. Figure 2 of [1] presents separate two-dimensional PCA projections of the answer latent for PPBench puzzles. Their axes differ and cannot be compared directly. Our Section 3.2 measures full-state motion across all late solvers. Low motion alone cannot distinguish an attractor from slow neutral drift or proximity to a saddle. Sections 3.3–3.5 examine these possibilities and identify the v1 direction used above.
Completion coincides with a drop of more than 10× in latent motion, aligned to each puzzle’s solve step (Figure 2), and solutions usually persist once found (859/875, 919/919 and 719/727). On Maze-Hard, valid alternative paths settle like reference-matching paths, while invalid paths remain about 1000× more active (Appendix K). Motion therefore provides a training-free signal of settling across tasks.
These diagnostics suggest how to allocate compute. About 69% of nominal-budget failures are resolved by additional steps alone. A trajectory that is still moving can receive more steps; one that has settled but fails a correctness check can receive a v1 kick; one that has settled and passes can stop. This motivates allocating compute by trajectory state instead of assigning K rollouts to every puzzle as in [1].
The stability results also suggest what to regularize. Completion lowers the estimated local spectral radius ρ from 3–5 to at most 1, while σmax remains 6–27, revealing strong non-normality. Perturbations along v1 initially grow, then decay in the attention models or remain bounded in the MLP (Figure 15b). Jacobian-norm penalties stabilize fixed-point solving in equilibrium models [3]. For recurrent reasoners, our results motivate studying ρ or the trajectory gain γnat as regularization targets.
The main analysis covers four checkpoints: Attention-A, Attention-B, an MLP, and a Maze model. All exhibit trajectory-conditioned anisotropic stability. Attention-B has 25 saved training snapshots; the later snapshots show the same qualitative behavior as the reported terminal checkpoint, so we omitted these repetitive results. We also add a public MLP checkpoint and a separate DT-Recall maze study, where 954/1,000 trajectories first become valid after 30 updates. Further training runs are underway to assess generality across more checkpoints.
[1] A. Sghaier, A. Parviz, and A. Jolicoeur-Martineau. Probabilistic Tiny Recursive Model.
[2] Z. Ren and Z. Liu. Are Your Reasoning Models Reasoning or Guessing? A Mechanistic Analysis of Hierarchical Reasoning Models.
[3] S. Bai, V. Koltun, and J. Z. Kolter. Stabilizing Equilibrium Models by Jacobian Regularization.