- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper aims to address the performance degradation of large VLA policies caused by inference delays at test time. The proposed method, DEFLECT, fine-tunes a policy using preference learning. It uses a frozen reference policy to predict action chunks from observations at time and at the shifted time . The optimization objective augments the original SFT loss with a DPO loss that favors the action chunk generated from the observation at over the one generated from the observation at . The experiments evaluate a flow-matching policy on Kinetix and different VLA backbones on LIBERO, as well as three real-world tasks, with evaluations under different inference delays.
Critical strengths
1.The paper explains its central idea clearly, and inference delay is a critical problem for large models.
2.The paper evaluates the proposed method across different VLA backbones and in both simulation and real-world settings.
Critical weaknesses
-
The motivation for preference learning is unclear. The current objective combines an SFT loss on the unshifted action chunk, weighted by 1.0, with a DPO loss favoring the shifted action chunk, weighted by 0.02. The contribution of the DPO term appears small compared with that of the SFT term. The paper also evaluates Future SFT, which replaces the DPO term with a regression loss. It is unclear to me why preference optimization would perform better than regression. The paper should provide further analysis and explanation of this difference. Furthermore, Future SFT is evaluated only for GR00T on LIBERO, without a real-world comparison. Since this is the closest baseline and the performance gap on LIBERO is small, comparisons across additional backbones and potentially real-world tasks would provide stronger evidence for the proposed method.
-
The evaluation provides limited coverage of dynamic manipulation scenarios that require reactive control. The two simulation environments only partially reflect real-world scenarios involving dynamic scenes that require reactive actions. Kinetix is a 2D dynamic environment that evaluates a non-VLA policy, and its action space is simpler than that of typical manipulation tasks. LIBERO is a common VLA manipulation benchmark, but most tasks involve picking and placing static objects and may not place high demands on reactivity. Additional benchmarks featuring dynamic tasks would therefore better assess reactivity and robustness to inference delays—for example, RoboDojo[1], which includes a conveyor task.
[1]Chen, Tianxing, et al. "RoboDojo: A unified sim-and-real benchmark for comprehensive evaluation of generalist robot manipulation policies." arXiv preprint arXiv:2607.04434 (2026).
Questions for authors
- What is the weight on the future-target term in Future SFT? Did you similarly ablate that term to choose the best one as you did for your method?
- Can you list more detailed breakdown results in the appendix instead of only the average success results?
- Also it might be more straightforward to the readers if you can provide metrics beyond success rate to demonstrate the robustness to delay. In simulation, you can potentially compute the prediction error to oracle to show the robustness or visualize the trajectories to show how the proposed method works better than the other baselines. More qualitative analysis or failure mode analysis of baselines can also help readers better understand the proposed method.
We thank the reviewer for the detailed feedback and for recognizing the importance of inference delay, the clarity of our central idea, and our evaluation across multiple VLA backbones and real-world settings. Changes in the revised manuscript are highlighted in blue. We hope our responses and revisions address your concerns
Comment/Question:
Answer: Preference learning provides greater flexibility by teaching the policy which actions are better, rather than forcing it to imitate a single future action as the only correct answer. Since future actions cannot be uniquely determined from a stale observation, directly regressing to one future-generated target can impose an overly restrictive constraint. DEFLECT instead learns to prefer future-aligned actions over stale alternatives while allowing multiple valid behaviors. The original SFT loss preserves basic action skills, and the preference update weakens once a sufficient margin is reached (Section 3.2 and Appendix D, Eq. 11). This advantage is reflected in the results. On GR00T at d=4, DEFLECT achieves 73.10% success versus 65.75% for Future SFT (Table 1a), with smoother action transitions (Appendix M). Appendix I (Fig. 10) further shows that the DPO term contributes substantially despite its small coefficient, with weighted gradient-norm ratios of 0.33 on Kinetix and 0.40 on GR00T.
Comment/Question:
Answer: We have extended the evaluation to SmolVLA, Kinetix, and three real-robot tasks. On SmolVLA, DEFLECT achieves 60.26% average success, compared with 55.48% for Future SFT. On Kinetix, we swept four values of λ₊ for Future SFT. Averaged over d = 1–4, DEFLECT achieves 88.6%, compared with 87.53% for the best Future SFT configuration (λ₊ = 0.1). The real-robot results further support this advantage. On Conveyor-I and Conveyor-II, DEFLECT achieves 96.7% and 90.0% full-task success, compared with 93.3% and 86.7% for Future SFT. On Whack-a-Mole, DEFLECT strikes 13.6 targets per 30-second trial, compared with 11.6 for Future SFT.
Comment/Question:
Answer: We have added an evaluation on RoboDojo's dynamic conveyor manipulation task (Section 4.1.3, Fig. 6, and Appendix O). Compared with the Naive Async baseline using the original π0.5 checkpoints, DEFLECT improves success across all tested delays, with gains of 4.0 percentage points at d = 6 (15.33% vs. 11.33%) and 7.3 points at d = 8 (14.67% vs. 7.33%), despite constructing preference pairs using only 1–4-step delays. These results further support DEFLECT's robustness to observation delays in dynamic VLA manipulation.
Comment/Question:
Answer: Future SFT uses λ₊ = 0.1, and we have added a weight sweep for both methods (Appendix H, Fig. 9 and Tables 7–8). We evaluate weights of 0.01, 0.1, 0.25, and 1. The best Future SFT configuration achieves 82.91% average success, compared with 85.76% for DEFLECT at its default weight. DEFLECT also outperforms Future SFT at every tested weight.
Comment/Question:
Answer: We have added per-suite and per-delay results in Appendix N (Table 13) for GR00T N1.7, π0.5, and SmolVLA, providing the detailed breakdown behind the averages in Table 1.
Comment/Question:
Answer: We have added quantitative behavioral metrics and representative trajectories beyond success rates (Appendix M, Figs. 12–15). First, we evaluate action prediction errors against future expert actions. At d = 4, DEFLECT achieves the lowest scaled RMSE of 0.471, compared with 0.528 for Naive Async and 0.495 for Future SFT, indicating better alignment with the future expert reference. We also analyze action discontinuities, completion steps, and representative failure cases under matched conditions (Figs. 12–14). Specifically, we measure the replanning action jump ratio, which quantifies action changes at chunk boundaries relative to those within a chunk. Compared with Naive Async, DEFLECT reduces this ratio by 0.9–1.5, versus 0.3–0.4 for Future SFT, indicating smoother transitions between action chunks. The trajectory visualizations further illustrate differences in execution behavior and failure patterns.