- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes Cross-Cycle Batching, an inference schedule for flow-based robot policies that requires no additional training. It distributes the denoising steps of each action chunk across multiple control cycles and batches updates from chunks at different denoising stages using the latest observation. This reduces sequential model calls per cycle while keeping the same number of denoising steps per chunk. Unfinished chunks are shifted and padded at the tail to stay aligned with the updated prediction window. Experiments on RoboTwin 2.0, LIBERO, and four real-robot tasks show reduced inference latency across several policy models, with success rates close to serial sampling and denoising speedups of up to 3.1×.
Critical strengths
-
Speeding up existing policies without retraining is a practical strength. The method reduces sequential calls per cycle by rescheduling denoising updates across action chunks, without changing the model weights or architecture or reducing the number of denoising steps per chunk. This makes it relatively straightforward to apply to existing pretrained policies.
-
The evaluation goes beyond a single model or a small set of tasks. The authors test several policy models across all 50 RoboTwin 2.0 tasks, LIBERO, and four real-robot tasks. Across these settings, inference latency decreases while success rates remain close to full-budget serial sampling. This gives me more confidence in the method’s applicability beyond a particular model.
Critical weaknesses
-
I am still unclear about the specific gap in prior work that this paper addresses. The motivation to reduce serial denoising latency is clear, but the contribution beyond existing rolling-sampling and pipelining methods needs to be explained more concretely. The experiments do not directly compare against StreamDiffusion, Streaming Diffusion Policy, or FASTER, nor do they sufficiently explain why these methods would be unsuitable for the current setting. The mixed-progress baseline is particularly unclear: the original model takes a single flow time for the entire action chunk, while this baseline assigns different flow times to different positions. How this is implemented with the frozen model needs clarification. Without this detail, it is difficult to tell whether its lower success rate comes from the sampling approach itself or a mismatch with the pretrained model. This limits my ability to assess the improvement over the closest prior work. RTC is already used in the real-robot deployment, but its contribution and that of the proposed method also need to be distinguished more clearly.
-
The experiments do not directly address whether early denoising under older observations affects the policy’s ability to respond to changes in the environment. A chunk’s early updates use observations from previous cycles, leaving only a limited number of updates when its execution cycle arrives. My main concern is whether these remaining updates can sufficiently revise the earlier prediction when, for example, the target moves or the robot encounters a disturbance. The overall success rates across tasks show that the method works under the tested conditions, but they do not resolve this question. I would like to see tests involving changes during execution, along with success rates and response behavior across different cross-cycle spans. Otherwise, it remains unclear whether the speedup comes at a cost when actions need to be adjusted quickly.
Questions for authors
-
Could you clarify the specific gap in existing work that motivates this method? The paper does not clearly explain which unresolved problem in prior approaches it aims to address.
-
When the environment changes, could intermediate states formed under older observations hinder the policy’s ability to adjust? Are the remaining denoising steps sufficient to correct the earlier predictions?
-
Could you explain why the experiments do not include direct comparisons with related methods such as StreamDiffusion, Streaming Diffusion Policy, FASTER, and RTC?
-
What is the main improvement over existing rolling-sampling methods? In particular, how is the mixed-progress baseline implemented without modifying the pretrained model, given that the model takes a single flow time for the entire action chunk while this baseline assigns different flow times to different positions? Without this clarification, it is difficult to tell whether its lower success rate comes from the sampling approach itself or a mismatch with the pretrained model. Could you clarify this implementation and explain the differences from the closest prior methods more concretely?