- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper studies what iterations do in TRM-style recursive reasoners on Sudoku-Extreme. The authors build compact solvers by combining TRM’s two-state recurrence, SE-RRM’s digit-field representation and EqR’s training recipe, and report strong full-test accuracy at small parameter counts. Around this they run a series of interventions: matched-error repair comparisons, message removal and replay, slow/fast state resets, alternative initializations, and candidate-pool selection, plus a short analysis of released TRM on ARC-AGI. They frame the results as “learned correction dynamics” and propose a “learned relaxation with memory” conjecture.
Critical strengths
- The compact-solver result is strong and verifiable, with released checkpoints and per-puzzle records.
Critical weaknesses
-
The paper is poorly written and has no central thesis. Almost every paragraph is a list of numbers with no argument connecting the numbers, and each finding is immediately hedged with a statement that the mechanism was not identified. The “relaxation with memory” framing is a metaphor, and the sections do not build toward a claim. A paper that cannot communicate its findings has not done its job, regardless of soundness.
-
The headline findings are from models the paper itself says are not representative. The dramatic initialization effect appears only at an over-trained checkpoint of a single MLP run, and the authors state it does not occur in any benchmark model; this looks like an artifact of a poorly trained model. The coverage-vs-selection failure appears only in a TRM the authors trained themselves; their own attention models don’t show it and the released TRM is never tested.
-
The solver is an unmotivated combination of three existing methods. No design rationale is given, there is one seed per size, and the authors acknowledge they cannot say where the gain over SE-RRM comes from. The SOTA claim also holds only under one specific protocol.
Questions for authors
See weaknesses
2 comments
I thank the authors for the substantial rewrite and additional experiments; the paper is clearer, but I believe many concerns still remain. The architectural and training choices are still not fully ablated, the strong initialization failures remain specific to their MLP model and not attention model or other released models, and the severe coverage vs selection failure is not shown to generalize to released models. I therefore maintain my score of 1.
Thank you for encouraging us to connect the findings more clearly. We have clarified the argument and distinguished the benchmark evidence from diagnostic cases (General response, point 4).
W1. Central thesis and presentation. Useful recursion depends on repairing the current state, reaching a successful trajectory, and keeping and selecting correct answers. We now connect the experiments to these requirements, with a closing roadmap in the introduction and a discussion focused on what the findings enable. We also reduced numerical lists, moved procedural detail to the appendix, and collected open questions in Limitations and Future Work so they do not obscure the results.
We treat relaxation with memory as a hypothesis: internally reinforcing errors resist isolated correction, while retained or reconstructed context supports coordinated revision. Exploratory candidate energy functions decreased on average but sometimes rose between iterations, giving us a concrete starting point for developing predictive relaxation models (Appendix A.6). The matched-error tests show that arrangement matters, and replay separates preserving an answer from finding one (§9; Tables 7–9). Following the submission's proposed score-preserving tests, we now construct a transfer operator between trajectories of the same puzzle. It transfers a source-specific component of later correction responses beyond matched controls while keeping current answer scores fixed. Our reply to qqri, W1 gives these controls and the accompanying communication tests.
W2. Representative models and failure cases. The central repair, communication and retained-state results use the benchmark attention models. We highlight the 94k MLP checkpoint because it makes the initialization contrast especially clear: it has the lowest fixed-start accuracy among the 25 checkpoints examined after 50k updates, while Gaussian starts remain reliable (Appendix A.11). The initialization contrast also occurs within the 50k-update training budget: at 22k updates in the studied MLP run, fixed starts return 31 of 128 answers, while both Gaussian starts return at least 125 at unchanged weights and depth (Table 11). The capability is therefore already present in the weights; changing the start exposes it without retraining (see also EqR, Huang et al., ICML 2026, §5.1). Fixed and Gaussian starts both solve reliably at the validation-selected attention checkpoints; the extended training series comes from the MLP run (§5.1; Table 12).
The selection result also extends beyond our own TRM. In released ARC TRM, more starts increase coverage, giving more queries a correct candidate but returning fewer correct answers in one pool; selected correctness improves in another (Appendix A.4.1). Even the benchmark attention models occasionally select a new wrong candidate over an available correct one as their pools grow (Table 16). These are ranking failures, distinct from losing an answer along a trajectory. Moreover, in an earlier Attention 256 training ablation, jointly removing Gaussian starts and the training branch for perturbed solutions increases missed available answers (Table 14).
W3. Design rationale, attribution and seeds. Matched retraining favors two-state recurrence, and three Attention 192 training runs reproduce the strong full-test performance. We credit the inherited components. Digit fields represent competing assignments, shared recurrence reuses parameters, and the slow state supplies context for fast updates (§2). Our contribution is the compact solver and its experimentally characterized dynamics.
Two-state recurrence improves solving with and without dropout at matched parameter count and network applications per iteration, and the advantage persists from the same displayed grids (Tables 21A, 22). Three Attention 192 training runs average 99.59 full-test accuracy at 64 iterations. Our reply to YSDB, W3 gives the variation across these training runs and the repeated cooperation result. Other widths and the remaining combinations of state count and dropout have one run each. The matched comparison identifies the recurrence design's contribution within our implementation. With one fixed-start trajectory on the full test, the submitted Attention 192 checkpoint exceeds SE-RRM's published accuracy at each matched depth (Table 5).