- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The core idea behind this paper is pretty straight forward. When using diffusion or flow-based planners, the entire denoising trajectory contains information that is useful for replanning at subsequent time steps.
The authors argue that reusing this history allows a new plan to be generated with fewer sequentially dependent model calls (denoising steps), resulting in faster inference while retaining the original denoising schedule.
BATON reuses the entire denoising trajectory from the previous planning step. It transports this trajectory by shifting the action horizon, repeating the last action to complete the tail, and restoring the current noise boundary according to the denoising schedule. It then performs two successive parallel-denoising rounds, each using one batched model call, and combines the two refined trajectory estimates using Anderson mixing.
Critical strengths
-
The method appears straightforward to implement within compatible diffusion- and flow-based planners.
-
It is training-free and empirically demonstrates substantial inference speedups over replanning from scratch and the observed speedups are roughly in the ballpark for reduced planning steps of a diffusion based planner.
-
The evaluation covers several policy–benchmark combinations that I consider relevant, including and Fast-WAM on LIBERO-Plus and RoboTwin 2.0.
Critical weaknesses
- Novelty : Based on my understanding, novelty is limited. The main contribution is the transport-to-replanning pipeline. While reasonable the contribution is narrow because most of the underlying components already exist . To be more specific, many of the elements (and not limited to the following) of the proposed method are available in different prior works based on my reading.
ParaDiGMS[1] introduced Picard-parallel denoising and its application to receding-horizon Diffusion Policy. ParaTAA initializes parallel sampling from previous correlated conditioning input’s denoising steps [2], with anderson mixing. RTI-DP’s main contribution as far as I understand is it shifts previous action predictions and repeats the final action for subsequent refinement [3].
My concern is that many of its distinct algorithmic ingredients exist. The contribution is mainly the particular cross-replan full-trajectory transport and its integration into a fixed two-round solver.
-
Clarity and presentation. The paper is very difficult to read in its current form because of its heavy reliance on jargon and paper-specific terminology. A more but not limited to accessible abstract, introduction, and preliminaries would help communicate the relatively straightforward idea it presents. I strongly recommend a substantial rewrite to explain the central intuition before introducing the detailed notation and analysis.
-
Limited guarantees for error accumulation. I could not find any theory that would support that approximation error remains uniformly bounded over long episodes. The cross-replan in Appendix C.4 provides a long-run bound iff and the transport mismatch remains bounded. However, I could not find in the paper if the authors establish that the former condition holds for the evaluated policies.
References:
[1] Parallel Sampling of Diffusion Models, shih et al
[2] Accelerating Parallel Sampling of Diffusion Models, Tang et al
[3] Real-Time Iteration Scheme for Diffusion Policy, Duan et al
Questions for authors
-
Error accumulation over long episodes. How does approximation error evolve over many consecutive replans when each new plan is initialized from BATON's own cached approximate trajectory? Appendix D.4 includes LIBERO-Long tasks, but that diagnostic uses serial-generated history and therefore does not measure the accumulation of errors from repeated approximate replanning. Could the authors provide a long-horizon closed-loop evaluation that measures error as a function of the number of replans? This would help clarify the potential tradeoff between inference speed and error accumulation.
-
Choice of Anderson mixing. The oscillation analysis motivates mixing successive iterates, but is an adaptive mixing needed? Would a constant mixing ratio achieve comparable performance? A fixed-weight mixing ablation would help distinguish the benefit of combining the two estimates from the benefit of selecting the coefficient adaptively. I am asking this since the anderson mixing is posed as another contribution of this work and to what extent does it make a difference?
-
Conditions for the recursive bound. Can the authors establish, or provide empirical evidence, that the coefficient in Appendix C.4 remains below 1 across successive replans?
-
Utility of denoising history Do we really need to remember every intermediate denoising state? Please compare BATON against keeping only the previous final action chunk, shifting it, and constructing noisy versions to initialize the same two parallel rounds and Anderson mixing.