- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies the latency–action quality trade-off in real-time control with flow-based vision-language-action models. Streaming execution releases near-term actions before the full chunk has been denoised, but these actions may retain prediction errors, while fixed denoising budgets and execution horizons do not accommodate varying state demands. The authors propose DASH: Difficulty-Aware Denoising (DAD) predicts convergence difficulty from the hidden states of the first denoising forward pass and jointly adjusts the denoising budget and execution horizon; Maturity-Oriented Matching (MOM) uses perturbed frozen prefixes during training and per-action maturity embeddings to improve subsequent generation under imperfect prefix context. DASH reduces denoising computation while maintaining or improving task performance, reports up to a 3.44× model-estimated reaction speedup over synchronous inference, and improves real-world task success under perturbations.
Critical strengths
• DASH achieves substantial improvements in inference efficiency while maintaining competitive task performance. Across two backbones and two GPUs, it reports a model-estimated reaction speedup of 2.21–3.44× relative to synchronous inference, with further improvements over FASTER. Jointly adapting computation and observation frequency is a useful contribution to real-time robot control.
• The reduction in denoising computation is considerable. The reported average number of denoising steps decreases from 10 to 2.90 on LIBERO and 6.75 on CALVIN, while task performance is maintained or improved.
• The real-world experiments support the practical value of the approach. DASH achieves success rates of 82% and 84% under target and receptacle relocation, compared with 70% and 76% for FASTER. The shuffled-scheduling control also provides evidence that state-dependent allocation contributes to the gains.
Critical weaknesses
• The construction of maturity conditions during MOM training is unclear. Equations (7)–(8) define embeddings using planned and remaining denoising steps, whereas Algorithm 1 samples a continuous flow timestep without specifying how the training budget and discrete step index are selected. The correspondence between these quantities should be made explicit.
• Table 3 supports the usefulness of MOM when combined with DAD, but the roles of its two components are less clear. In Table 5, full MOM improves Avg. Len by only 0.013 over maturity conditioning alone and 0.025 over prefix perturbation alone. Without uncertainty estimates, it is difficult to assess whether these differences establish complementary benefits. An explanation of why MOM is more effective under adaptive scheduling would also be helpful.
• Minor: Figure 7 uses inconsistent colors for the same methods across conditions, and the legend obscures a numerical label. Its caption does not accurately distinguish the CALVIN images from the real-world examples. Appendix A.5 also contains incorrect figure references. In Figure 5, the colored "Inputs" label should be changed to black for consistency with the other section labels.
Questions for authors
• How are the planned and remaining denoising steps constructed from the sampled flow timestep during training?
• Are the differences between the MOM variants in Table 5 consistent across seeds, and what explains the stronger benefit of MOM under adaptive scheduling?
As we are now halfway through the discussion period, I encourage reviewers to follow up on the authors’ responses and authors to address any remaining questions to help ensure a constructive discussion.