- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
Large robot policies often use asynchronous inference to avoid pauses: the next action chunk is generated while the previous one is still executing. The cost is that new actions are conditioned on stale observations and are executed open-loop, so errors accumulate and the trajectory drifts from what synchronous inference would produce. Inspired by speculative decoding, SAVE-WAM treats asynchronously generated actions as drafts and verifies them with newer observations during execution. Verification uses a single velocity-field evaluation: the draft is noised to flow time τ, and the predicted velocity under the new observation is compared with the velocity implied by the draft. If the score exceeds a threshold, the remaining actions are discarded and the policy replans. Verification is also run one segment ahead so that it overlaps with execution. The method is training-free and plugs into existing asynchronous schemes (FDM, RTC). On RoboTwin 2.0 with LingBot-VA, it raises success from 82.76% (Async-64) to 92.76%, on par with Sync-16, while executing about 1.97× more actions per policy call.
Critical strengths
The method is simple and practical. It needs no training, can be added on top of existing asynchronous schemes, and replaces full re-inference with a single forward call for verification.
The key comparison is convincing. SAVE-WAM and FDM Async-32 have nearly the same average executed chunk size (31.55 vs. 32) and the same inference time (30.99 s), yet SAVE-WAM’s success rate is about 7 points higher (92.76% vs. 85.64%). This shows that the gain comes from verification itself, not just from using shorter chunks.
Critical weaknesses
The efficiency claims are misleading. The “1.97× throughput” refers only to executed chunk size, not actual speed. In wall-clock completion time, SAVE-WAM is slower than the asynchronous baselines it builds on: 91.43 s vs. 76.66 s (Async-64) and 80.31 s (Async-32) for LingBot-VA, and 41.02 s vs. 34.97 s (RTC) for FastWAM, i.e., 14–19% slower. It is only about 7% faster than Sync-16 (97.97 s), and it is also slower than RTC on LIBERO (7.15 vs. 6.50 s). Moreover, SAVE-WAM and Async-32 report identical inference time, yet SAVE-WAM takes 11 s longer per episode, and the paper does not explain where this overhead comes from. Completion time is also averaged only over successful episodes, which differ across methods, so the comparison is biased. In essence, the method trades time for success rate, and presenting it as an efficiency improvement in the abstract and contributions overstates the result. The “73.8% latency overlap” in the abstract is never defined in the main text.
The theorem adds little in practice. The bound depends on the unknown quantities δ_θ, δ_str, and L_x, and requires L_x(1−τ) < 1, so it cannot be checked in practice; δ_str effectively assumes the flow is nearly straight. The real support for the verifier is the empirical correlation in Appendix A.2, not the theorem.
Questions for authors
Since SAVE-WAM and FDM Async-32 have the same inference time but SAVE-WAM takes about 11 s longer per episode, could you break down the end-to-end time into verification, replanning, and waiting? Please also report completion time on the episodes where all compared methods succeed, so that the time comparison is not biased by different success sets.
Several closely related adaptive-execution methods are cited but not compared, especially those that check consistency between imagined and real observations (Wang et al., 2026b; VLA-Corrector; Rethink Before You Execute) and the denoising-variance approach (Feng et al., 2026). How does SAVE-WAM compare with them in success rate and wall-clock time when applied to the same asynchronous backbones?
5 comments
Authors' Rebuttal Comments for Reviewer v9FA (Part2/2)
(Inherited from the previous part)
W2: The theorem adds little in practice.
We agree that these empirical results provide more direct evidence of the practical effectiveness of the verifier than the theoretical bound alone. Following the reviewer's suggestion, we will move the key empirical validation results into the main paper.
Q2: Several closely related adaptive-execution methods are cited but not compared
A: We appreciate the reviewer for pointing out these closely related works. We have expanded our comparisons to include publicly available implementations of VLA-Corrector[1] and the denoising-variance approach (AutoHorizon[2]) with FastWAM. And unfortunately, due to the lack of open-source code and training datasets for Rethink Before You Execute[3] and FFDC[4], we are unable to condduct experienment on them.
We emphasize that SAVE-WAM differs from these methods in its design objective and integration requirements. Specifically, SAVE-WAM is a training-free, post-generation feedback mechanism supporting asynchronous action execution.
In contrast, VLA-Corrector introduces an additional training-based correction mechanism. The denoising-variance approach estimates uncertainty from the denoising process, but its original implementation does not natively support asynchronous action execution. We have therefore evaluated the available methods under FastWAM and added the corresponding comparisons:
| Suite | Ours (SR / Time) | AutoHorizon (SR / Time) | VLA-Corrector (SR / Time) |
|---|---|---|---|
| LIBERO-10 | 90.00% / 10.44s | 91.20% / 12.19s | 88.00% / 18.86s |
| LIBERO-Goal | 93.00% / 5.82s | 94.40% / 5.23s | 92.00% / 9.51s |
| LIBERO-Spatial | 94.60% / 5.96s | 91.80% / 5.81s | 93.40% / 9.78s |
| LIBERO-Object | 99.00% / 6.38s | 97.40% / 6.42s | 95.40% / 11.15s |
| Overall | 94.15% / 7.15s | 93.70% / 7.37s | 92.20% / 13.06s |
Overall, SAVE-WAM achieves the highest average success rate (94.15%) while maintaining the lowest average completion time (7.15 s). These results demonstrate that SAVE-WAM provides a favorable trade-off between task success and execution efficiency, without requiring additional training and while supporting asynchronous action execution.
Reference
[1] Yi Pan, Miao Pan, Qi Lu, Jiaming Huang, Man Zhang, Siteng Huang, Xin Li, Jie Zhang, Yongliang Shen, Xuhong Zhang, et al. VLA-Corrector: Lightweight Detect-and-Correct Inference for Adaptive Action Horizon. arXiv preprint arXiv:2607.01804, 2026b.
[2] Haoxuan Wang, Gengyu Zhang, Yan Yan, Ramana Rao Kompella, and Gaowen Liu. VLA Knows Its Limits: Adaptive Execution Horizons for Robot Policies. arXiv preprint arXiv:2602.21445, 2026a.
[3] Feng Ye, Yiming Zhao, Yong Yu, Hongxu Zhou, Yong Pan, Yuan Xue, Peng Jia, and Chuanmin Jia. Rethink Before You Execute: Adaptive Execution for World Action Models. arXiv preprint arXiv:2608.09492, 2026b.
[4] Rui Wang, Yue Zhang, Jiehong Lin, Kuncheng Luo, Jianan Wang, Zhongrui Wang, and Xiaojuan Qi. When to Trust Imagination: Adaptive Action Execution for World Action Models. arXiv preprint arXiv:2605.06222, 2026b.
Kind Reminder from the Authors
Dear Reviewer v9FA,
Thank you again for your valuable comments and feedback. As the reviewer–author discussion period will conclude in less than 24 hours, we would greatly appreciate it if you could let us know whether our responses have adequately addressed your concerns or if there are any remaining questions we could further clarify.
We sincerely appreciate your time and consideration, and look forward to hearing from you.
Best regards,
The Authors
Authors' Rebuttal Comments for Reviewer v9FA (Part1/2)
We sincerely thank Reviewer v9FA for the detailed and constructive feedback. Thank to the reviewer for acknowledging our feedback on improving the success rate. We have highlighted the corresponding revisions in blue in the revised manuscript. Our point-by-point responses are provided below.
W1&Q1: The efficiency claims are misleading.
Thanks to reviewers suggestions and we have modified the claims in abstract to the actual speed up in real robot experiment in the revised version Sec.5.3. We would like to clarify that SAVE-WAM targets a different point in the reliability–latency trade-off. Native asynchronous methods such as FDM and RTC are optimized for low latency, but their speculative actions can deviate from the actual execution trajectory without feedback. SAVE-WAM introduces verification and replanning overhead to recover this lost reliability while retaining the benefits of asynchronous execution.
A: Failed rollouts are excluded because the simulator imposes a maximum action-step limit, causing unsuccessful episodes to terminate at the action cap rather than upon actual task completion. Their recorded durations are therefore censored and cannot provide a meaningful comparison of task completion time. And in our calculation, completion time on the episodes where all compared methods succeed is close to completion time on the episodes where one method succeed:
A: The additional overhead mainly comes from synchronous replanning triggered by rejected verifications. SAVE-WAM and Async-32 have similar average executed action horizons and thus comparable policy generation costs. However, Async-32 overlaps policy inference with action execution, achieving shorter completion times at the cost of lower success rates. In contrast, SAVE-WAM selectively introduces synchronous replanning when the verifier detects potentially invalid actions. These replanning steps cause additional execution stalls but substantially improve task success rates.
A: Overlap ratio (73.8%) measures the fraction of accumulated policy inference time hidden by asynchronous execution, rather than the proportion of total episode time. For LingBot-VA on RoboTwin-clean, the average accumulated inference time is 30.99 s, while the average blocking time due to rejected verifications and subsequent synchronous replanning is 8.12 s. Therefore, the estimated inference-time overlap ratio is
R_{\mathrm{overlap}}=\frac{T_{\mathrm{infer}}-T_{\mathrm{blocking}}}{T_{\mathrm{infer}}}=\frac{30.99-8.12}{30.99}=0.738.
Breakdown of time
We further provide a breakdown of the timing costs to clarify the source of the additional overhead.
The increased end-to-end latency mainly comes from verification-triggered synchronous replanning. Note that the reported end-to-end time also includes action execution in the physics simulator, whose execution overhead contributes to the overall latency. We additionally conduct real-world robot experiments to evaluate the method beyond simulation below to persue visible acceleration.
A: In a simulated environment, physical simulators often take a long time. Therefore, in fully asynchronous reasoning, the model inference delay is completely concealed. The total delay, which is the time it takes for the physical simulator to execute all actions, is already the shortest possible time. A larger action horizon does not demonstrate significant performance advantages. We further conducted experiments in real-machine scenarios. By adapting the execution frequency and action horizon, a larger action horizon can improve execution efficiency. It is possible to support a larger action horizon while ensuring task success rate. We also add the results and analysis in Sec.5.3.