- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
ReDexT learns a shared residual policy through control perturbations around optimized seed commands, followed by rollout-guided training over IK priors. On 256 held-out trajectories, it achieves 55.08% frozen success and 39.06% horizon completion, increasing to 80.08% and 75.39% after shared adaptation; the training recipe is also evaluated with separately trained policies for four additional hands.
Critical strengths
Control perturbations substantially improve transfer to IK commands, with consistent held-out gains under both SPIDER and IK training priors (Tables 8–9). This provides useful evidence for learning feedback that is less dependent on its nominal control source.
The Full-pool comparison matches architecture, control scales, training data, and interaction budget, supporting an improvement from 49.22% to 55.08% frozen success. The additional-hand experiments and explicit separation of frozen execution, adaptation, and horizon completion strengthen the empirical evaluation.
Critical weaknesses
The added value of the distinctive training stages remains unclear. Noisy IK and SPIDER bootstrap both achieve 28.13% held-out success (Table 8), while skipping bootstrap achieves 39.06% versus 40.23% for the bootstrap-plus-expansion route despite fewer updates (Table 11). Since these ablations use different control scales from the final model, they do not establish whether optimized-source bootstrap and rollout-based selection improve upon a simpler IK training curriculum at the default settings.
The evidence for an advance over existing shared trackers is incomplete. Prior methods such as DexH2R and DexTrack already learn shared reference-conditioned feedback, whereas the external comparisons primarily concern per-trajectory fitting; Appendix B.3 explicitly identifies IK-RL as an internal baseline rather than a reproduction. The matched Full-pool comparison is informative, but its 5.86-percentage-point improvement is based on one training seed, leaving the reproducibility of this gain unresolved.
Questions for authors
At the default control scales, how does ReDexT compare with IK-based bootstrap followed by the same expansion procedure, curriculum resets, and total interaction budget? This would clarify the contribution of optimized source commands beyond selecting successful seed tasks.
Can the evaluation include a representative existing shared tracker under a controlled protocol? This would help establish the success–compute tradeoff relative to methods that already avoid fitting each new trajectory.
How stable is the ReDexT–Full-pool improvement across training seeds? The paired intervals in Table 9 address different comparisons and quantify trajectory variation conditional on fixed checkpoints, rather than variability across training runs.