- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
SplineWAM targets manipulation WAMs whose fixed action chunks impose a fixed replanning interval. It predicts fixed-size windows of adaptively fitted cubic B-spline parameters, using knot times to determine execution duration and future-video supervision. JP-RTC guides asynchronous predictions toward committed actions through the decoder Jacobian. Evaluation uses Fast-WAM on LIBERO-Plus and RoboCasa, with original-LIBERO and controlled-delay results in the appendices, plus three bimanual robot tasks with 30 trials per method and task.
Critical strengths
The integration addresses a concrete execution problem. Knot times coordinate video targets and execution duration without a separate horizon predictor (Sections 3.3–3.4, pp. 4–5). JP-RTC compares decoded actions, allowing successive windows to use different knot placements. Tables 7–8 provide empirical support for this choice over parameter-space RTC. This is a useful WAM integration of the spline representation credited to Han et al. in Section 2, rather than merely another compression format.
The synchronous comparisons support the full method. Backbone, demonstrations, and training budget are shared (Section 4.1, p. 6). Table 1 reports success gains of 8.2 and 4.4 points alongside fewer calls. Tables 3–4 show gains across six of seven LIBERO-Plus categories and all four RoboCasa families. Figure 4 also sweeps execution budgets for the baselines, making the comparison more informative than one chosen operating point.
Critical weaknesses
The benefit attributable to adaptive scheduling remains unclear. Figure 4 compares different representations as their execution budgets change, but does not compare fixed-step and row-budget execution using the same trained SplineWAM. The results therefore support the combined representation-and-alignment method more directly than the claim that adaptive execution improves the success–cost trade-off. This distinction matters because the spline representation and local-window construction are explicitly inherited (Section 2, p. 3). Video alignment is separately ablated, but knot-grid alignment’s additional gains over window alignment are only 1.2 and 1.6 points (Table 1), without training-seed variability; Appendix D explicitly reports single-run estimates (p. 19).
The asynchronous accuracy–cost claim needs stronger evidence. The headline call reductions come from synchronous Table 1. Under the eight-step delay, success advantages over action chunking shrink to 0.6 and 2.7 points, without accompanying asynchronous efficiency measurements (Tables 7–8, pp. 16–17). JP-RTC adds a Jacobian and solve at every denoising step, but runtime is not measured (Appendix E, p. 21). Table 2 does show longer robot chunks. However, its success gains correspond to one additional Bookshelf completion and three Whiteboard completions; Charge Earphone ties in success and loses 15.8 progress points. These observations support feasibility, but do not establish accuracy equivalence or measured cloud-throughput gains. The statement that the efficiency gain “costs no accuracy” (p. 9) is stronger than the evidence supports.
Questions for authors
Clarification: Which data selected the fitting tolerance and execution budget? Section 4.3 selects deployed settings from the sweeps, while Appendix D states there was no perturbation-specific model selection. Were the settings fixed independently of the reported test outcomes, and were baseline execution budgets selected by the same rule?
Targeted control: On one suite, can the same trained SplineWAM be compared under fixed-step and row-budget replanning at matched mean steps per call? This would directly test the scheduling contribution without changing representation or video supervision.
Targeted validation: At one asynchronous operating point, can you report success uncertainty across training runs, calls per control step, and measured accelerator time including JP-RTC? A reliable success–cost advantage would materially strengthen my assessment; an exhaustive latency sweep is not necessary.
3 comments
To Review pQHY: Part 1 of 2
Q1. Selection of ε and H. No separate validation set was used: both were chosen on the evaluation suites. The baseline's budget was chosen on the same data, and is its best point in the range we evaluated.
- ε. We did not search for an optimal ε. We evaluated only four widely spaced compression ratios (raw actions per knot ≈1.0 / 1.5 / 2.0 / 3.0). The value 1.0 tests whether the B-spline representation is learnable at all, and 3.0 tests heavy compression of the action space. We do not claim that 1.5 is optimal, since we did not search around it. It is a rough value at which the method works on both suites, and it was carried over unchanged to the robot. The gain over action chunking does not hinge on this value: it is already +7.1 / +3.7 points at 1.0.
- H. H needs no retraining, so we evaluated a range of budgets for action chunking, Naive B-Spline and SplineWAM (Fig. 4). Table 1 uses one row budget per suite for all spline variants, chosen so that SplineWAM executes about as many steps per call as the baseline's best point; for action chunking and SplineWAM this is also their best point. At matched executed length, SplineWAM leads at every budget, with the margin narrowing at the longest budgets.
The phrase "no perturbation-specific model selection" in Appendix D meant that ε and H were shared across all perturbation factors.
Q2. See W1 above. On the same trained model, the row budget improves over a fixed schedule at every matched length on both suites, by up to 3.2 points.
Q3. See W2 above. Over three training seeds, JP-RTC is better than action chunking with RTC at the operating point of Table 8 (47.6 ± 0.8 vs. 44.9 ± 0.7), and every JP-RTC run is above every RTC run. With H = 16, it needs 0.63× the calls per control step at comparable success. W2 also gives the measured per-call time, including JP-RTC.
Dear reviewer pQHY,
As the discussion period comes to an end, we would be grateful to hear whether our responses have addressed your main concerns. If there are any remaining questions or points that would benefit from further clarification, please let us know. We would be happy to provide additional information.
To Review pQHY: Part 1 of 2
We thank the reviewer for the clear and actionable questions. We ran both experiments requested in Q2 and Q3 as specified, and report them under W1 and W2.
W1. Benefit of adaptive scheduling; contribution of alignment.
Same trained model, fixed vs. row-budget execution. We executed the deployed SplineWAM checkpoints with a fixed number of steps per call, and compared them with the row budget at matched mean steps per call. The row budget improves over the fixed schedule at every matched length on both suites:
The improvement is larger on LIBERO-Plus, where knot spacing varies more within an episode than in RoboCasa's MimicGen demonstrations. With the schedule fixed, the same model still leads action chunking by 7.8 points at 8 steps per call on LIBERO-Plus; the row budget adds 0.5 points there and 3.2 at 16.9 steps. The fixed schedule removes only the adaptive replanning interval: the model still predicts, and is supervised on, the adaptive knot grid.
Contribution of alignment. Knot-grid and window alignment are two design variants within our method, and knot-grid placement is the better of the two on both suites (+1.2 / +1.6). Over three training seeds on LIBERO-Plus, this margin holds in the mean (74.3 ± 0.8 vs. 73.1 ± 0.5), a gap comparable to the seed variation. We therefore describe it as a smaller further gain, and measure the contribution of alignment itself against Naive B-Spline, which is the inherited representation trained on the same backbone without alignment. Against it, alignment gains +3.8 / +4.0 points at the Table 1 operating points, growing to +7.8 points at longer executed spans on LIBERO-Plus.
W2. Asynchronous accuracy–cost evidence; real-robot claims.
Asynchronous operating point. We evaluated all three seeds per method on LIBERO-Plus under the 8-step delay of Table 8:
On the real-robot computer (RTX 4090), a call takes 240 ± 10 ms for both methods. Guidance adds at most 10 ms per call for JP-RTC and at most 2 ms for RTC.
Real-robot claims. We agree that "costs no accuracy" overstated the evidence. What the robot results do show is a consistent inference-cost advantage at comparable task performance: