- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces a behavior-cloning policy that updates two recurrent states using a small shared network. These states persist across control steps, and the paper also studies training-time perturbations of the carried state. Evaluation covers multi-task learning, few-shot adaptation, and history-dependent manipulation on three benchmarks. The experiments report competitive performance with a compact backbone and examine the ablation effects of persistent state, recursion depth, model size, and temporal gradient propagation.
Critical strengths
-
I believe the performance is good, especially considering the small model capacity. TRP achieves 91.9% success on LIBERO-LONG with a 4.2M-parameter backbone. Its LIBERO-Mem subgoal-completion score is 0.597, compared with approximately 0.41 for the strongest reported non-TRP baseline.
-
Also, the ablations provide useful insights beyond aggregate performance. The execution-time interventions distinguish whether carry is needed during execution from whether it helps during training. An interesting point I found is that the paper also shows that carry is not uniformly beneficial: its effect depends strongly on recursion depth. I find this interaction more informative than simply demonstrating that a recurrent policy uses historical information.
Critical weaknesses
-
I think the architectural novelty is limited and the validation of the two-level recursion is insufficient. TRP largely adapts existing HRM/TRM-style recursion to stateful control. While Table 3a shows that carry and recursion interact, the comparison between H3L6 and H1L1 also changes the computation budget (21 vs. 2 updates). Thus, it remains unclear whether the gains come from the two-level architecture or simply additional computation. A compute-matched single-loop baseline would help establish the value of the proposed design.
-
The source of the parameter-efficiency advantage remains unclear. The 4.2M-versus-336.3M comparison in Table 1 is a genuine and significant parameter difference, but it combines different backbone choices with different computation schemes; it does not quantify the contribution of weight sharing itself. My another concern is whether a straightforward, similarly sized recurrent MLP/Transformer, with the same setup (such as observation encoder, action horizon), could achieve a comparable performance–parameter trade-off. This distinction matters because compactness alone does not establish the value of the proposed recursive design.
I would be happy to raise my score if the authors address my concerns.
After reading the rebuttal: I've raised my rating, see reasons below.
Questions for authors
-
How does TRP compare with a single-loop recurrent policy using the same shared computation block, persistent carry, and comparable per-prediction computation, while keeping the encoder, action horizon, data, and training setup fixed? A focused comparison on LIBERO-LONG and LIBERO-Mem would directly address whether the two-level update schedule provides additional value.
-
Could you separate the parameters in the shared computation core from the remaining backbone parameters and give the corresponding count for an otherwise identical unshared version? For performance attribution, how does a similarly sized, simple recurrent MLP/Transformer perform under the same observation and training setup?