- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SparseWAM, a training-free inference acceleration method for Fast-WAM. It sparsifies World-to-Action Conditioning KV tokens using semantic relevance and diversity-based selection, and applies dynamic layer skipping in the Action DiT to reduce inference cost. Experiments cover LIBERO, LIBERO-Plus, and real-robot manipulation tasks. With 50% KV retention and ActionSkip, inference latency decreases from 455.73 ms to 369.20 ms, while achieving success rates of 95.00% on LIBERO and 50.66% on LIBERO-Plus.
Critical strengths
S1. Useful empirical analysis of sparsification locations in WAMs.
The paper compares input visual token pruning with downstream conditioning KV pruning and examines their effects on control performance. These results provide concrete empirical observations that help inform the choice of compression location in WAM architectures.
S2. Relatively comprehensive internal ablations and efficiency evaluation.
The authors evaluate different KV retention ratios, token selection orders, and ActionSkip both independently and in combination. The latency breakdown, LIBERO-Plus perturbation results, and controlled real-robot trials help characterize the behavior of different compression configurations.
Critical weaknesses
W1. Limited technical novelty and insufficient evidence for the independent contributions of key design choices.
SparseWAM's core acceleration mechanisms largely build on existing QK-affinity-based semantic scoring, DivPrune, and the dynamic layer-skipping strategy of Flash-Unified. The new design primarily involves adapting and combining these mechanisms within Fast-WAM, including grouped KV selection and joint scheduling. However, the current evidence does not sufficiently establish the independent value of these design choices.
In Table 2, Semantic → DivPrune improves over DivPrune alone by only 0.80 and 1.33 percentage points on LIBERO and LIBERO-Plus. Without a random filtering baseline matched for the intermediate candidate budget, it remains unclear whether these gains arise from semantic relevance or merely from modifying DivPrune's candidate set.
W2. Limited incremental efficiency gains from the joint method and insufficient explanation of the main speedup results.
Table 3 shows that ActionSkip alone reduces inference latency from 455.73 ms to 378.40 ms while nearly preserving task success. Adding 50% KV sparsification provides only a further 2.43% latency reduction, while decreasing LIBERO and LIBERO-Plus success rates by 1.80 and 1.27 percentage points.
The more aggressive 25% KV joint configuration achieves approximately 1.28× speedup over dense Fast-WAM, but reduces success rates by 6.65 and 7.78 percentage points. Since ActionSkip alone accounts for most of the acceleration, the incremental value of world-side sparsification remains insufficiently demonstrated. The lack of comparable evaluations against other competitive training-free acceleration methods further limits the assessment of its accuracy–efficiency advantages.
Additionally, the reported ActionSkip speedup requires further explanation. According to the execution schedule in Section 3.4, ActionSkip reduces the nominal number of Transformer block executions by only 12 out of 300 (4 steps × 3 blocks out of 10 steps × 30 blocks, 4%), whereas Table 10 reports a reduction in action-stage latency from 379.66 ms to 322.13 ms (15.15%). Although these quantities need not be strictly proportional, the paper does not provide sufficient computational cost or execution-path analysis to explain this discrepancy, leaving the source of the main speedup unclear.
Questions for authors
Q1. Could the authors provide a Random Filtering → DivPrune baseline with the same intermediate candidate budget (93%) and final KV retention (25%) to evaluate the independent contribution of semantic selection? Please also clarify the intermediate token budget and selection rules used in the DivPrune → Semantic reverse-order ablation.
Q2. Could the authors clarify the actual number of Transformer blocks executed at each ActionSkip denoising step and provide the corresponding FLOPs analysis or finer-grained latency breakdown to explain the discrepancy between the reduction in block executions and the measured latency gains?
Q3. Could the authors provide a broader comparison with representative training-free acceleration methods for VLA/WAMs to better establish SparseWAM's competitiveness in the accuracy–efficiency trade-off?