- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The task is to reduce robot policy inference cost (diffusion/flow-based VLAs and world action models) by deciding how many predicted actions to execute before observing and replanning. The baselines use a fixed execution length or adapt it using attention weights or uncertainty across multiple predictions. The paper executes more actions from each predicted sequence when motion stays smooth. The method measures smoothness by summing the magnitudes of changes between consecutive predicted velocities. It assumes smooth action sequences remain reliable for longer without new observations.
Critical strengths
- The method requires no retraining, model internals, or additional predictions.
- Across three simulation benchmarks, policy calls decrease by 1.2-1.7x while reported success stays equal or improves. Physical robot tasks finish 11-14% faster. The experiments cover four policies, including a world action model.
Critical weaknesses
- Against AutoHorizon, success increases by only 0.5-3.7 percentage points. Inference time improves only 1-2% on two benchmarks and worsens on the third. Real-robot tests use only 10 trials per task, for which the gains are not statistical significant assuming a 95% confidence interval.
Questions for authors
- How does the method select the target reuse ratio without success labels?
- Does smoothness predict reliability, or just easy motion? Maybe there is a way to test smooth but incorrect predictions and unexpected disturbances?
Response by Authors
We sincerely thank the reviewer for the valuable comments. We have conducted new experiments on a label-free selection of τ, a reliability analysis across motion difficulty, and robustness to unexpected disturbances. All new results are included in the revised paper (highlighted in blue). We address each concern below.
W1. Comparison with AutoHorizon and statistical significance.
We would like to clarify that the main advantage of our method over AutoHorizon [1] is that it requires no access to model internals. This allows our method to be applied directly to diverse models, including a World Action Model, which is not covered by AutoHorizon. On top of this practical advantage, our method achieves comparable or better performance gains. Notably, on RoboTwin 2.0, AutoHorizon falls below the baseline (59.7 → 56.8), whereas our method does not (59.7 → 60.5).
For the real-robot experiments, we note that AutoHorizon likewise reports 10 trials per task. Nevertheless, we agree that the gains in success rate are not statistically significant, and we have toned down our claims accordingly. Please refer to the revised Section 4.2.
Q1. Label-free selection of the upcycling ratio.
Thank you for this important question. The upcycling ratio, and implicitly τ, can be selected without success labels. For example, we set τ to the median velocity fluctuation of the prefix actions, computed from 10 random baseline episodes without success labels, and use this single τ for all tasks. As shown in Table 1, this simple rule maintains or improves success rate while reducing policy calls by about 1.7×, further supporting its practicality. Please refer to the revised Appendix B.3.
Table 1. Label-free selection of τ on LIBERO.
Q2. Reliability vs. motion difficulty, and unexpected disturbances.
In response to this question, we examine whether velocity smoothness indicates reliable tail actions or merely easy motion. We divide each episode into three phases of increasing difficulty: free-space motion, transport, and grasp/release. Within each phase, we compare tails executed and discarded by our method in terms of their error to the replanned actions.
As shown in Table 2, the executed tails show nearly 2× lower error in every phase, including hard motion such as grasp and release. This shows that smoothness predicts reliability, not merely easy motion. Please refer to the revised Appendix B.5.
Table 2. Error of tails executed and discarded by our method (lower is better; π0.5, LIBERO).
Furthermore, to test unexpected disturbances, we apply object displacement and end-effector push (2/4/6 cm) at a random step during execution. As shown in Table 3, our method performs comparably to or better than the baseline under all disturbances (95.3 → 95.8 on average), while reducing policy calls by about 1.5×. These results show that our method remains robust under unexpected disturbances. Please refer to the revised Appendix B.7.
Table 3. Success rate (%) under execution-time disturbances (π0.5, LIBERO).
Reference
[1] Wang et al., "VLA Knows Its Limits: Adaptive Execution Horizons for Robot Policies", ECCV 2026.