- Rating
- 2
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Discrete Forcing, a coarse-to-fine action-generation framework for vision-language-action models. It first predicts quantized discrete action tokens from masked inputs, then uses their dequantized values as a structured source for one-step continuous flow-matching refinement. The discrete and continuous branches share early Action DiT layers but use specialized later branches. Experiments on LIBERO, RoboTwin 2.0, RoboCasa-GR1, and four real-world manipulation tasks report improved success rates and lower latency than continuous-action baselines, including 97.6% on LIBERO with two function evaluations and a 16.4-point average improvement in the real-world task-progress metric.
Critical strengths
1.The discrete-to-continuous formulation is conceptually clear and technically motivated. The method directly targets the trade-off between compact coarse structure and precise continuous control, while the ablations on generation order, discrete guidance, one-step training, and shared layers support the proposed mechanism.
2.The empirical evaluation is broad and practically relevant. The paper reports results across single-arm, dual-arm, humanoid, long-horizon, and real-world manipulation settings, together with latency, memory, scaling, and trajectory-structure analyses. The gains at two function evaluations are consequential for deploying VLA policies under real-time constraints.
Critical weaknesses
1.The claimed parameter matching is not sufficiently verifiable. The implementation describes 2 shared layers and 22 branch-specific layers per execution path, so storing both branches could require substantially more parameters than a single 24-layer action expert unless widths or other components are adjusted. The paper should provide exact total stored parameters, trainable parameters, inference memory, and training compute for Discrete Forcing and every matched baseline. Without this, the performance gains may partly reflect additional capacity rather than the discrete-to-continuous design.
2.The causal evidence for the proposed forcing mechanism remains incomplete. During training, the continuous branch primarily receives ground-truth quantized actions, while inference uses predicted discrete actions; the predicted-source ablation is reported only on LIBERO-Long. In addition, most comparisons rely on StarVLA, and the real-world evaluation uses a π0-based instantiation with four hand-designed tasks and 20 trials per task. More evidence is needed to establish robustness to discrete prediction errors and to separate architectural benefits from backbone-, dataset-, or task-specific effects.
Questions for authors
1.What are the exact total parameter counts and stored-weight memory for Discrete Forcing versus StarVLA at each model scale, including both discrete and continuous branches? Are training FLOPs and optimizer states also matched?
2.How often do predicted discrete tokens differ from the ground-truth quantized source during training/evaluation, and do the predicted-source results hold across the other benchmarks and model scales? Please clarify whether any ground-truth discrete information is available at inference.
3.For the simulation and real-world comparisons, were all baselines trained on identical demonstrations, optimization budgets, and evaluation seeds? Please provide per-task results and uncertainty estimates for the real-world task-progress numbers.
Thank you for the clarifications. The parameter counts and source-noise setting resolve my concerns on those points. Two concerns remain:
The supplied implementation uses 56 scalar action tokens in the discrete branch and 8 vector action tokens in the continuous branch. Does the first stage of Continuous→Continuous preserve the scalar-wise tokenization? If not, matching depth and width does not isolate discretization, since token granularity also changes.
The main distinction from related work is now source initialization versus conditioning. Table 4 does not directly compare these two uses of the same discrete prediction. Adding branch communication to the full method is a different control. The response explains the design difference, but its added value over existing coarse-to-fine refinement remains insufficiently established.
The interpretation of Fig. 4(b,c) should also be narrowed: comparing completed discrete predictions with raw intermediate noisy states cannot establish an advantage in clean-action prediction.
The empirical gains are useful, but these remaining concerns about the contribution and its attribution keep me at 2.