- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper addresses a practically relevant problem, as iterative sampling introduces substantial inference latency in WAM-based robot policies. The framework requires no changes to pretrained model parameters or architectures. Its acceptance criterion accounts for the influence of both video and action inconsistencies on the final action output. Evaluation across multiple model architectures, simulation settings, and real-world tasks provides useful evidence of applicability.
Critical strengths
- The paper addresses a practically relevant problem, as iterative sampling introduces substantial inference latency in WAM-based robot policies.
- The framework requires no changes to pretrained model parameters or architectures. Its acceptance criterion accounts for the influence of both video and action inconsistencies on the final action output.
- Evaluation across multiple model architectures, simulation settings, and real-world tasks provides useful evidence of applicability.
Critical weaknesses
W1. Incomplete comparison with alternative acceleration approaches. The evaluation focuses on TeaCache and ParaSolver, without comparisons against distilled policies or strong reduced-step sampling configurations. Although distillation requires additional training, reduced-step sampling provides a particularly relevant training-free baseline. The current results do not establish whether DASH offers a better success-rate–latency trade-off than simply reducing the sampling steps or using a stronger fast sampler. W2. Limited evidence of improved closed-loop responsiveness. The real-world evaluation covers three tabletop manipulation tasks, including deformable-object manipulation. However, it does not systematically examine dynamic targets, external perturbations, or recovery during execution. Although improved closed-loop responsiveness motivates the method, the reported inference latency and aggregate success rates do not directly establish whether faster sampling improves the robot’s response to environmental changes. W3. Insufficient evaluation of the trade-off between hardware resources and latency. In the representative configuration in Appendix E, DASH achieves a 1.93× speedup using five NVIDIA L40S GPUs relative to a single-GPU sequential baseline, while increasing total model-state evaluations from 10 to 16.1. Trading additional computation for lower latency is reasonable, but the evaluation does not sufficiently establish the advantage over optimized baselines under the same GPU budget. More complete scaling and resource-cost measurements are needed to assess its deployment value.
Questions for authors
Q1 How does DASH compare with reduced-step sampling and stronger fast samplers across a range of sampling budgets? Could you provide success-rate–latency curves and, where feasible, comparisons with distilled policies, reporting their additional training cost separately? Q2 Does DASH improve task outcomes or reaction time when the environment changes during execution? Could you evaluate controlled perturbations, such as target displacement or object disturbance, and report response delay, recovery success, and task completion time? Q3 How does DASH compare with optimized baselines given the same GPU budget? Could you report latency scaling with GPU count, peak memory usage, and GPU-seconds per action chunk to clarify the resource cost of the reported speedups?