- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 3(+1)
Read review
Paper summary
Current robot foundation policies often use a fixed chunk size when executing actions in the environment. However, different phases in the same task may require different chunk sizes depending on how delicate the move is. This paper follows an adaptive chunking approach, which aims to predict the optimal chunk size during test time. It proposes to combine intra-chunk stability and inter-chunk continuity for each chunk size, estimating the stability of the generated action chunk and continuity with the executed history, to approximate the reliability of the chunk size. It then introduces a training-free approach, AHS, to track the in-episode chunk size reliability and a training-required approach, QHA, to predict the cross-task chunk size reliability. Experimental results show that combining their proposed adaptive chunking method can consistently outperform VLAs' and WAMs' base policies across both simulation and real-world robot tasks.
Critical strengths
- The analysis in Figure 2 provides interesting insights into why a task might fail and well motivates the proposed method.
- The proposed adaptive chunking method, AHS, is training-free and showcases promising improvements over the base policies.
- The real-world robot experiments further strengthen the reliability of the proposed approach.
Critical weaknesses
- The paper lacks a thorough comparison with previous works; it conducts small-scale experiments with AAC and some horizon-selection variants, but does not include a full-scale comparison like Table 1 with AAC and AutoHorizon, which are included in the related works.
- Currently, the base policies evaluate only one fixed chunk size; the authors should provide fixed large chunk sizes and smaller ones to support that the improvements are from adaptive chunk size, not just using smaller ones.
The reviewer will raise the score if the authors address these problems.
Questions for authors
- From the experiments in Table 3, it seems that choosing yields the best performance without introducing a huge replan time. Why did the authors choose a smaller candidate set for other experiments?
- In equation 10, if the target is to find the optimal chunk size, what will happen if we use instead?
- Since the score is estimated using the generated action chunk without environment feedback, why not update the beta state with the true value instead of the soft feedback ?
4 comments
Q1: “Why did the authors choose a smaller candidate set for other experiments?”
As shown in Tab. 3 (Lines 430–443), we agree that the dense candidate set 𝒦₅₀={1,…,50} achieves the best success rate with only a small increase in per-replan time. We choose 𝒦₅={10,20,30,40,50} as a compact default because AHS combines action evidence with online memory, and expected-round can still select intermediate horizons without scoring every possible length. This is especially useful for longer predicted horizons, where scoring every possible length requires evaluating more candidates.
This choice also reflects the success–compute trade-off in our additional 50-task evaluation. Expanding from 𝒦₅ to 𝒦₅₀ increases success from 63.65% to 64.00%, while increasing replans from 13.91 to 16.94 per episode and inference time from 2.813 s to 3.334 s per episode. Thus, 𝒦₅ offers a compact default, while 𝒦₅₀ is a reasonable choice when the additional success is preferred.
| Method | Success ↑ | Replans / ep. | Inference s / ep. |
|---|---|---|---|
Fixed K=40 (optimal) | 59.05% | 9.63 | 1.830 |
AHS (𝒦₅) | 63.65% | 13.91 | 2.813 |
AHS (𝒦₅₀) | 64.00% | 16.94 | 3.334 |
We have added an example of selecting an intermediate horizon in Sec. 4.1 (Lines 287–291) and compared success and cost for sparse and dense candidates in Sec. 5.4, Tab. 5 (Lines 480–485).
Q2: “What will happen if we use Kₜ = argmaxₖ μₜ(k) instead?”
As shown in Eqs. 9–10 (Lines 251–267), AHS combines current action quality with online memory to form a preference distribution. Argmax selects only its highest-probability candidate, while expected-round combines the candidate preferences and can select an intermediate horizon. This reduces reliance on a single winner when candidates have similar preferences and provides finer control over re-observation timing.
In additional experiments, argmax-only reaches 62.30%, compared with 63.65% for AHS, an absolute difference of 1.35%.
We have added the selection example in Sec. 4.1 (Lines 287–291) and the argmax-only comparison in Sec. 5.4, Tab. 5, with the variant described in Lines 520–524.
Q3: “Why not update the beta state with ... q_mix ... instead of the soft feedback yₜ?”
As described in Eqs. 11–12 (Lines 293–304), soft feedback averages the candidates’ quality scores according to their selection probabilities. The kernel shares this feedback with horizons near the executed Kₜ, while forgetting discounts older evidence. This design lets nearby choices share recent evidence as the task phase changes.
In additional experiments, direct-q_mix reaches 62.45%, compared with 63.65% for AHS. We have added this comparison to Sec. 5.4, Tab. 5 and specified that direct-q_mix updates candidates with their individual quality scores (Lines 520–524).
| Method | Success ↑ | Replans / ep. | Inference s / ep. |
|---|---|---|---|
| AHS | 63.65% | 13.91 | 2.813 |
| AHS argmax-only | 62.30% | 15.24 | 2.862 |
AHS direct-q_mix | 62.45% | 14.29 | 2.707 |
Full per-task results for these ablations are provided in Appendix H, Tab. 18.
[1] VLA Knows Its Limits: Adaptive Execution Horizons for Robot Policies. ECCV 2026.
[2] Adaptive Action Chunking at Inference-time for Vision-Language-Action Models. CVPR 2026.
I thank the authors for their thorough responses and the extensive experimental results. Since all my questions and concerns have been resolved, I'm happy to raise my score to 3.
Thank you so much for your positive assessment and support. We sincerely appreciate your time and constructive feedback.
Thank you for your careful review and for recognizing the insights in analysis, the AHS method, and the real-world evaluation. We address your comments and questions below.
Thank you for highlighting the need for comparisons with adaptive and fixed horizons. We evaluate both under the same frozen pi_0.5 policy on 50 RoboTwin2.0 tasks in Easy and Hard settings, with
2,000matched episodes per method.K=3058.95%13.142.636K=4059.05%9.631.830K=5056.30%8.021.63159.30%14.362.89459.15%8.7342.92563.65%13.912.813𝒦₅₀)64.00%16.943.334𝒦₅₀={1,…,50}denotes the dense candidate set. We evaluate AAC and AutoHorizon with the same pi_0.5 policy, using their official code and hyperparameters. For AAC, we sample20chunks per replan due to official default. Timings include policy and selector work on shared RTX 4090 GPUs.Across all 50 tasks, AHS improves success over Fixed
K=30/40/50by4.70%/4.60%/7.35%, respectively, and over AutoHorizon and AACN=20by4.35%and4.50%, respectively. These results show that ChunkTrust improves manipulation success over the displayed fixed horizons and previous works.We have added the baseline comparison and cost analysis to Sec. 5.4, Tab. 5 (Lines
471–485), with per-task results in Appendix H, Tab. 18.