- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CF-Prune, a training-free method for accelerating pretrained world action models by removing future-video tokens while retaining observation tokens. It constructs a pruning mask during the first conditional forward pass using complementary instruction and action attention, with Gaussian smoothing and separate treatment of wrist and third-person views. An attention-entropy criterion disables pruning on calls identified as requiring precise interaction. The method is evaluated with Cosmos3-based policies on 120 RoboLab tasks, four RoboCasa tasks, and three real-robot tasks. At 35% pruning, the reported average inference speedups are 1.19-1.27x, with higher measured success rates. At 50%, the simulation speedups reach 1.29-1.33x and aggregate success remains close to the dense baseline, although some individual tasks deteriorate substantially.
Critical strengths
-
The paper targets a useful source of computational redundancy: future visual representations used to support action prediction. Being able to remove these tokens from an existing checkpoint without retraining is practically appealing. I find the distinction between preserving visually detailed predictions and preserving information needed for control well motivated. The measured gains remain useful even with only four denoising steps on RoboLab and the real robot.
-
The evaluation goes beyond a token-count or FLOPs argument. The authors report measured inference speedups and closed-loop success, distinguish coarse-phase from average speedup, and include both simulation and physical manipulation. The broad RoboLab evaluation is a particular strength. Table 4 also provides some evidence that combining the two attention sources is useful, rather than relying on either alone.
Overall, I lean toward weak acceptance. The results make a credible case for a useful training-free speed/accuracy tradeoff, even though the explanation of which components are responsible needs stronger controls.
Critical weaknesses
-
The experiments do not fully isolate the benefit of the proposed selection and phase criteria. The speed-matched Obs + future VLA baselines prune observations as well as future tokens, whereas CF-Prune preserves observations. Matching average latency is helpful, but this still leaves open whether some of the advantage comes from where pruning is applied rather than how tokens are ranked. Similarly, the phase ablation raises success from 35.3% to 37.8% by restoring dense computation on 31.4% of calls. Without a control that restores dense computation on the same fraction of calls, or uses milder fixed pruning at comparable latency, this does not establish that the entropy criterion identifies especially valuable calls. These controls matter because complementary selection and phase identification are the main methodological contributions.
-
The evidence for improved or preserved success is less secure than the headline averages suggest. No confidence intervals or repeated-seed variability are reported. The real-world gain from 85.3% to 90.7% corresponds to four additional successes across 75 trials, and the RoboLab gain at 35% pruning is 1.3 percentage points. These are encouraging observations, but they do not yet substantiate the proposed regularization explanation. At 50% pruning, RoboCasa navigation falls from 38% to 18%, despite an aggregate drop of only one point. The authors acknowledge this failure, but it places an important limit on the performance-preservation claim. All experiments also use Cosmos3-based policies, so the evidence currently supports this model family rather than WAMs generally.
Questions for authors
-
With observation tokens preserved and the phase schedule held fixed, how does CF-Prune compare with the adapted VLA scoring rules, or a simple uniform/random future-token mask, at comparable latency? This would help separate the value of the proposed scoring rule from the choice to prune only future tokens.
-
How were the three phase thresholds in Appendix A.1 selected, and were the evaluation tasks or rollouts used in that selection? On RoboLab, does entropy-based gating outperform random dense-call allocation or milder fixed pruning when average inference cost is matched?
-
Were initial states and sampling seeds matched between methods? Could you provide uncertainty estimates for the main success-rate differences and the Table 4 ablations, using paired outcomes where available? I would also appreciate an analysis of the navigation failures at 50% pruning, particularly whether the assumption of a stable third-person scene breaks down there.
4 comments
Dear Reviewer qhVP,
Thank you again for your thoughtful review and valuable feedback. We have provided detailed responses to address each of your comments and concerns.
As the discussion period is coming to an end, we would greatly appreciate it if you could take another look at our responses. If any part of our explanation remains unclear or if we have misunderstood any of your concerns, we would be sincerely grateful for the opportunity to provide further clarification.
Thank you again for your time and consideration.
Best regards, The Authors
Thank you for the additional experiments and clarifications. My main concerns have been addressed, and I will maintain my score of 3 (Weak acceptance). Please incorporate the supplementary results and acknowledged limitations into the revised manuscript.
We thank the reviewer for confirming that the main concerns have been addressed. We briefly summarize the additional evidence and clarifications below.
1. Controlled comparisons of selection and phase identification. On 40 RoboLab tasks, with observation tokens preserved and the phase schedule fixed, CF-Prune achieved 43.3% success, compared with 32.3% for adapted SpecPrune-VLA scoring, 34.4% for SP-VLA scoring, and 37.8% for random pruning. Under matched average latency, random phase identification and milder fixed pruning at 25% achieved 40.5% and 41.8%, respectively, versus 43.3% for CF-Prune. Thresholds were selected using separate calibration rollouts; some calibration tasks overlapped with evaluation tasks, but no evaluation rollouts were used.
2. Statistical reliability. The full 120-task RoboLab evaluation used identical initial states and random seeds across methods. Paired 95% confidence intervals for the success-rate difference (CF-Prune minus Dense) were [−1.08, +3.83] percentage points at 35% pruning and [−3.25, +1.58] at 50%. Neither difference was statistically significant. Accordingly, we emphasize inference acceleration with competitive task performance rather than treating the observed gains as definitive evidence of regularization.
3. Navigation limitation. We acknowledged the success-rate drop from 38% to 18% on Navigation at 50% pruning. Its broader spatial dependencies and changing spatial relevance are consistent with higher third-person attention entropy (0.809 versus 0.712–0.762 for the other manipulation tasks). We discussed aggressive pruning and the observation-derived shared mask as possible contributing factors, rather than established causes.
4. Additional backbone evaluation. On Flux3 Action across all 120 RoboLab tasks, CF-Prune achieved 42.0% success versus 41.2% for Dense, with a 1.24× speedup, extending the empirical evidence beyond Cosmos3.
We have incorporated the supplementary results and acknowledged limitations into the revised manuscript.
We appreciate the reviewer's feedback and the positive assessment of our work. Before addressing the specific concerns, we note that the additional experiments, unless otherwise specified, were conducted on 40 tasks selected from the full set of 120 RoboLab tasks, considering task difficulty and key manipulation characteristics.
W1, Q1, Q2. Effectiveness of Token Selection and Phase Identification
First, we would like to highlight that one of the key contributions of our work is identifying computational redundancy in future-video tokens repeatedly processed in WAMs and introducing them as a new target for pruning. Unlike observation tokens in conventional VLAs, future tokens lack clear visual information during initial denoising, making their importance difficult to estimate. To address this challenge, CF-Prune introduces a new token selection criterion specifically designed for these characteristics.
To evaluate the effectiveness of our selection criterion, we adapted the scoring criteria of SpecPrune-VLA and SP-VLA to prune only future tokens, while preserving observation tokens and keeping the phase schedule fixed. On 40 RoboLab tasks, SpecPrune-VLA and SP-VLA achieved success rates of 32.3% and 34.4%, respectively, compared with 43.3% for CF-Prune. Random pruning also achieved a lower success rate of 37.8%. These results demonstrate that the benefits of CF-Prune extend beyond the choice of pruning future tokens, supporting the effectiveness of our proposed selection criterion itself.
Furthermore, to evaluate the effectiveness of phase identification, we compared CF-Prune with random phase identification and milder fixed pruning at a 25% pruning ratio under matched average inference latency. These methods achieved success rates of 40.5% and 41.8%, respectively, compared with 43.3% for CF-Prune. These results suggest that entropy-based phase identification is more effective at selectively allocating dense computation to important inference calls, rather than simply increasing the computational budget.
Finally, the phase thresholds reported in Appendix A.1 were selected using separate calibration rollouts on a small subset of tasks in each environment. Some calibration tasks overlapped with the evaluation tasks, but no evaluation rollouts were used for threshold selection.
W2, Q3. Statistical Reliability, Navigation Failure, and Backbone Generalization
Statistical Reliability. All methods were evaluated on the full set of 120 RoboLab tasks using identical initial states and random seeds. We computed 95% confidence intervals for the success rate differences between the dense baseline and CF-Prune using paired rollout results. The intervals were [−1.08, +3.83] percentage points for 35% pruning and [−3.25, +1.58] percentage points for 50% pruning. Neither setting showed a statistically significant difference in success rate. Therefore, rather than interpreting the observed improvements as definitive evidence of a regularization effect, we emphasize CF-Prune's primary contribution of accelerating inference while maintaining competitive task performance.
Navigation Performance Degradation. We acknowledge that the performance degradation on Navigation at 50% pruning highlights a limitation of aggressive pruning, which may not preserve performance across all tasks. Navigation is one of RoboCasa's 25 atomic tasks and, unlike typical manipulation tasks, requires broader spatial context and involves changes in spatial relevance as the robot moves. Indeed, we observed higher third-person attention entropy for Navigation than for the other manipulation tasks (0.809 vs. 0.712-0.762), suggesting that aggressive pruning may remove important spatial information when attention is more broadly distributed. Furthermore, CF-Prune's observation-derived shared mask may be less suitable for such dynamic settings. We therefore interpret the degradation as a possible consequence of the interaction between navigation-specific characteristics and aggressive pruning, and acknowledge this limitation.
Backbone Generalization. We agree that the original evaluation was limited to Cosmos3-based models. To address this concern, we additionally applied CF-Prune to Flux3 Action, a different WAM backbone. The results of 35% pruning across all 120 RoboLab tasks are shown below.
CF-Prune maintained a comparable overall success rate of 42.0%, compared with 41.2% for the dense baseline, while achieving a 1.24× inference speedup. These results demonstrate that future-token pruning is not limited to Cosmos3 and can also be applied to another WAM backbone.
We will incorporate these additional results and clarify the corresponding evaluation procedures and limitations in the revision.