- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes WPFS, an inference acceleration framework for Diffusion VLA based on historical action trajectory reuse, aimed at reducing the computational overhead caused by repetitive planning. The method reuses unexecuted action chunks from previous iterations to generate new action trajectories via few-step denoising refinement, dynamically adjusts the execution horizon based on candidate trajectory consistency, and falls back to full planning when necessary. Furthermore, the authors introduce a lightweight Corrector that bypasses the large VLM backbone through knowledge distillation, further cutting inference costs. Extensive experiments conducted on pi0, pi0.5, and DB-OFT models across the LIBERO and SimplerEnv simulation benchmarks, as well as real-robot tasks, demonstrate that the proposed method achieves substantial inference speedups while maintaining or improving task success rates, with notable performance gains in dynamic real-world grasping tasks.
Critical strengths
The proposed method demonstrates a certain degree of novelty and practical value. By reusing historical Action Chunks and combining few-step denoising refinement with a dynamic execution mechanism based on candidate trajectory consistency, the method reduces the frequency of full VLA replanning. Furthermore, by distilling a lightweight Corrector, it avoids repeatedly invoking the large VLM backbone during trajectory refinement, further reducing inference overhead. Overall, the proposed method achieves a reasonable balance between inference efficiency and control performance.
Critical weaknesses
-
Strong Dependence on Historical Action Chunks. WPFS relies on reusing unexecuted action trajectories from previous planning cycles. Although the authors investigate different execution horizons in Appendix B.1, the experiments do not directly evaluate how reduced Action Chunk overlap affects trajectory refinement. When the execution horizon approaches the Action Chunk length, the remaining historical trajectory may provide less useful information for initialization. The effectiveness of trajectory recycling under such settings remains unclear.
-
Limited Coverage of Real-World Robotic Experiments and Real-Time Control Evaluation. Although the authors conduct real-world robotic experiments, the evaluation is limited to a single robotic platform and primarily considers static grasping and dynamic target grasping at two constant velocities. More challenging dynamic scenarios, such as sudden changes in target direction, temporary occlusions during target interception, or unexpected environmental disturbances, are not evaluated. Therefore, the robustness of WPFS in more complex dynamic environments remains insufficiently validated.
-
Insufficient Isolation of the Contribution of Self-Verification. In Appendix B.2, removing Self-Verification also changes the fallback behavior and lineage constraints. Therefore, the performance differences cannot be attributed solely to the verification mechanism. A more controlled comparison under identical replanning constraints would help clarify the independent contribution of Self-Verification.
Questions for authors
-
Regarding the Impact of Action Chunk Overlap: Although Appendix B.1 investigates different execution horizons, the impact of reduced Action Chunk overlap on trajectory recycling remains unclear. Could the authors further evaluate trajectory refinement performance, fallback frequency, and overall speedup under low-overlap settings to validate the applicability of the method across different execution strategies?
-
Regarding Real-Time Performance on Physical Robots: Although WPFS significantly reduces the average inference time per action, triggering full VLA replanning may still introduce control delays. Could the authors further report the fallback frequency, full replanning latency, and actual control frequency during real-world robotic experiments to clarify how these delays affect real-time control and task execution performance?
-
Regarding the Reliability of Self-Verification: The authors acknowledge that candidate trajectory agreement does not necessarily guarantee correctness. Could the authors further quantify cases where candidate trajectories agree but produce incorrect actions, and analyze how such cases affect execution length selection and the fallback mechanism?
9 comments
Follow-up: additions to the paper since our response
Dear Reviewer wzMy,
A brief follow-up, as the discussion closes on 18 November. Since we posted our response on 12 November, the PDF (last updated 15 November) has gained two further baselines on all three backbones, RTI-DP and STEP (Table 1; Tables R10–R11), and experiments on deliberately wrong priors, sudden goal changes and draft selection (Tables R6–R9). In Table 1, both WPFS variants are more accurate than RTI-DP and STEP on every backbone.
The results in our response above are unchanged, and each evaluation the review asked for is in the current version: low chunk overlap (Table R4), harder dynamics and real-time control (Table 2, Table R3), the agreement test under identical replanning constraints (Table R1), and drafts that agree but are wrong (Tables R5–R6).
We would be grateful to know whether these address your concerns, or what is still missing. We will reply promptly and can run a further analysis in the time that remains.
Thank you again for your time.
Thank you for the detailed response and additional experiments. However, after carefully considering the rebuttal and the revised manuscript, my overall assessment remains unchanged. Therefore, I will maintain my original rating.
Response to Reviewer wzMy
We thank the reviewer for a careful review. We ran every requested evaluation. The revised PDF has been uploaded: all changes are in blue, and the new results are in Table 2 and Appendices B.2, B.5, B.6 and E (Tables R1 and R3–R6).
Weakness 2 / Question 2: Harder dynamics and real-time control (Table 2, Table R3, App. E).
Weakness 1 / Question 1: Low chunk overlap (Table R4, App. B.5).
Weakness 3: Agreement test under identical replanning constraints (Table R1, App. B.2). With Λ and its forced re-plans kept identical, the test adds 6.4 points at the same cap (89.2% → 95.6%). On Spatial, WPFS-Large is 6–23% faster than fixed schedules within one episode of its success, and on Long no fixed schedule reaches WPFS's success with either corrector. For WPFS-Small, a tuned fixed schedule reaches a similar operating point on Spatial, so its speedup stems mainly from recycling and distillation; the test removes the need to tune the segment per suite.
Question 3: Drafts that agree but are wrong (Tables R5–R6, App. B.6). Individual actions have no ground-truth label, so our proxy for an incorrect action is a draft that leaves the policy's own plan distribution: at every correction we draw 8 fresh plans, hold one out as an honest sample, and call a draft off-distribution when its first 5 actions are farther from the other 7 plans than for 95% of honest samples.
The review found no substantive concerns about soundness, and its three weaknesses asked for evaluations that are now in the paper. If these address the concerns behind the rating, we would be grateful if the reviewer would consider raising it. We would welcome any further questions.
(Edited 13 Nov to match the revised PDF.)