- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates the mismatch between step-local gradient updates and full-target deep supervision in Tiny Recursive Models (TRMs). To address this issue, it proposes AS-TRM, an adaptive supervision method that dynamically constructs a task-specific focus set at each reasoning step based on trusted predictions and a state-dependent frontier. The proposed method prioritizes supervision on the focus set through a weighted loss while preserving the original halting mechanism. Task-specific strategies are developed for Sudoku, maze solving, and ARC-AGI-1, using constraint propagation, model-consistent shortest-path construction, and puzzle-level loss selection, respectively. Experimental results show that AS-TRM improves Sudoku performance across the tested recursion depths and, when combined with augmentation, improves Maze-Hard performance. On ARC-AGI-1, it shows faster convergence during the earlier stages of training but only a modest final performance gain. The paper further supports its findings through ablation studies, extended recursive rollouts, loss-landscape visualization, and gradient-alignment analyses.
Critical strengths
The paper identifies a clear mismatch between step-local gradients and full-target supervision. AS-TRM addresses this issue without modifying the TRM architecture and improves Sudoku performance across all tested recursion depths. The frontier ablations further show that the gains depend on selecting an appropriate adaptive frontier rather than merely supervising fewer cells.
The paper also provides valuable analyses of recursive stability, loss landscapes, and gradient alignment. Although some of these diagnostics are local or limited to particular checkpoints and training stages, they help explain how adaptive supervision can reduce gradient interference and produce more stable recursive reasoning, strengthening the paper’s technical contribution.
Critical weaknesses
The Maze-Hard gain should not be attributed to adaptive supervision alone. AS-TRM without augmentation underperforms the standard TRM baseline, while the reported improvement arises from combining augmentation with model-consistent shortest-path target construction. On ARC-AGI-1, the final performance gain is modest, although AS-TRM shows faster convergence during the earlier stages of training. Together, these results limit the evidence that the method generalizes beyond the strongest Sudoku setting.
The focus-set construction relies on task-specific structural rules, labels, or verification signals, which may limit its applicability to less structured reasoning tasks. In addition, the reported efficiency improvements are measured in training steps rather than elapsed training time, and the paper does not quantify the computational overhead of focus-set construction, including constraint propagation and shortest-path computation.
Questions for authors
-
Table 13 separates augmentation from the full AS-TRM method, but adaptive masking and model-consistent shortest-path target construction remain coupled. Could the authors provide or discuss a more controlled comparison that isolates these two components within the augmented Maze-Hard setting?
-
How well might AS-TRM generalize when task-specific structural rules or reliable training-time verification signals are unavailable? Could the authors also report elapsed training time and the computational overhead of focus-set construction to clarify the practical efficiency gains?