- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper proposes Heterogeneous Action Caching (HAC), a training-free framework for accelerating action generation in world action models. Using three recent full solver evaluations, HAC groups action-chunk positions by estimated trajectory curvature and predicts skipped outputs through copying, linear extrapolation, or a damped update. Accumulated drift on high-curvature positions triggers subsequent full evaluations, while the existing future-conditioning cache remains unchanged. Validation includes Faster-WAM and Fast-WAM on LIBERO and RoboTwin, a matched LIBERO-Plus subset, and paired GPU latency measurements. The authors report reducing full solver evaluations from ten to four while retaining similar in-distribution success rates; OOD performance is evaluated with a more conservative caching threshold.
Critical strengths
- HAC focuses on repeated action-solver evaluations after future conditioning has been cached. Its output-level wrapper requires no additional training or learned parameters and preserves the underlying checkpoint. This makes the approach appealing for reducing the deployment cost of existing world action models.
- The experiments cover Faster-WAM and Fast-WAM on LIBERO and RoboTwin, include distribution-shift evaluation on a matched LIBERO-Plus subset, and measure latency through paired runs on the same hardware. This combination addresses both computational savings and their consequences for task execution, providing relevant evidence of practical utility.
Critical weaknesses
- The curvature-based grouping, heterogeneous predictors, and drift-triggered refresh closely follow WorldCache. However, Table A2 lacks comparisons with uniform prediction, fixed refresh schedules, and reduced-step solvers under equal network-evaluation budgets. Consequently, the experiments do not establish how much benefit comes specifically from heterogeneous prediction and adaptive refreshing, weakening the methodological contribution beyond transferring an existing approach to action space.
- Table 4 implies approximately 1.82× overall and 2.23× solver speedups, inconsistent with the stated 1.63× and 1.86×. The reported LIBERO baseline of 98.65% is also incompatible with integer success counts over the stated 1,200 episodes under standard equal-weight aggregation. Furthermore, Appendix A.4 says the headline configuration drops the final FULL evaluation, conflicting with the default algorithm. These discrepancies require clarification of the actual configurations and raw counts before the claimed performance preservation can be reliably assessed.
Questions for authors
- What are the actual episode totals and integer success counts for each method in Tables 1–2? In particular, how is the LIBERO baseline of 98.65% obtained under the stated 1,200-episode protocol? Were the baseline and HAC evaluated with identical episode budgets and aggregation rules?
- Please specify the threshold and actual FULL/CACHE schedules corresponding to Tables 4 and A2. How do the reported latencies reconcile with the stated 1.63× overall and 1.86× solver speedups? Does default HAC retain the final FULL evaluation at η=12, as the algorithm specifies, or omit it, as Appendix A.4 states?
- Which algorithmic changes, beyond applying the framework to action outputs, distinguish HAC from WorldCache? Do any existing comparisons isolate the benefits of heterogeneous prediction and adaptive refreshing against simpler strategies with equal network-evaluation budgets? Please distinguish what the current experiments establish from design choices whose benefits remain untested.