- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes DART-VLA, a training-free framework for visual token pruning in vision-language-action models. At periodic full-scoring queries, the method constructs an L1 objective from the predicted normalized action chunk and uses absolute gradient-times-attention scores from the final layer to rank visual tokens. The selected indices are reused in subsequent queries to select freshly computed visual embeddings. Action-Relative Dynamic Budgeting adjusts the retention budget according to planned motion relative to episode history, while Action-Motion-Conditioned View Allocation distributes that budget between the main and wrist cameras. The paper evaluates the method on OpenVLA-OFT and OpenPI’s π0.5 across four LIBERO suites, together with experiments on a single-arm ALOHA platform. It reports average LIBERO success rates of 97.40% and 97.35%, with inference speedups of 1.26× and 1.15×, respectively.
Critical strengths
The paper provides empirical evaluation across multiple settings. DART-VLA is evaluated on OpenVLA-OFT and π0.5 across four LIBERO suites, with additional real-robot experiments. The reported results suggest that the framework can reduce inference latency while largely preserving task success. In particular, on OpenVLA-OFT it achieves 97.40% success compared with 95.50% for SP-VLA at similar reported latencies of 54.06 and 53.48 ms. These results provide encouraging evidence of practical utility for efficient VLA inference.
Critical weaknesses
-
Efficiency accounting needs clarification. The paper describes periodic full-scoring queries, but does not clearly explain how their scoring overhead is included in the reported latency and FLOPs. This makes the net efficiency gains difficult to assess.
-
The benefit of dynamic budgeting needs stronger support. Fixed 50% pruning in Table 2(d) achieves nearly the same success rate as the dynamic method at comparable latency. Without uncertainty estimates, the reliability of the small reported improvement remains unclear.
-
The methodological contribution appears incremental. VLA-Pruner [1] already incorporates action relevance into token selection, while SP-VLA [2] and ADP [3] adapt pruning to motion dynamics. DART-VLA introduces gradient-weighted scoring and specific budget and view-allocation rules, but these refinements represent a relatively limited conceptual advance over existing action-aware pruning methods.
[1] Ziyan Liu et al. Bridging the Semantic-Action Gap in Visual Token Pruning for Efficient VLA Inference. arXiv:2511.16449, 2025.
[2] Ye Li et al. SP-VLA: A Joint Model Scheduling and Token Pruning Approach for VLA Model Acceleration. ICLR, 2026.
[3] Xiaohuan Pei et al. Action-aware Dynamic Pruning for Efficient Vision-Language-Action Manipulation. ICLR, 2026.
Questions for authors
-
Accounting for scoring overhead. Do the reported latency and FLOPs include the full cost of scoring queries, including gradient computation and token selection? Please provide a cost breakdown and explain how the reported speedup is obtained when all costs are averaged across full-scoring and pruned queries.
-
Evidence for dynamic budgeting. Fixed 50% pruning achieves 97.20% success versus 97.40% for the dynamic method at essentially identical latency (Table 2). What evidence supports a reliable advantage from dynamic budgeting? Please quantify the uncertainty in this comparison.
-
Advance over prior work. What is the main new insight provided by Grad×Attention and the budget/view-allocation rules relative to VLA-Pruner, SP-VLA, and ADP? Please explain how the existing scoring and component ablations substantiate that advance.