DTP: A Simple yet Effective Distracting Token Pruning Framework for Vision-Language Action Models
Chenyang Li, Jieyuan Liu, Bin Li, Bo Gao, Yilin Yuan, Yangfan He, Yuchen Li, Jingqun Tang
TL;DR
Vision-Language-Action models often over-attend to task-irrelevant image tokens, hurting manipulation performance. The authors propose Distracting Token Pruning (DTP), an inference-time, plug-and-play framework that constructs a task-relevant region and an attention-based pruning mask to remove distracting tokens, refining action-token generation without changing model weights. They formalize an upper-bound analysis using conditional uncertainty $E(\alpha) = H(A^\ast \mid Z_{\alpha})$ and a normalized score $P(\alpha) = 1 - \frac{E(\alpha)}{H(A^\ast)}$, showing that sweeping the tolerance $\tau$ yields near-optimal attention patterns on multiple VLAs. Across SpatialVLA, Nora, and UniVLA, DTP achieves consistent task-success improvements and reveals a negative correlation between unimportant attention and success, motivating attention-aware robustness in future embodied AI. The work provides a practical, architecture-agnostic method to push VLA performance toward an empirical upper bound without retraining.
Abstract
Vision-Language Action (VLA) models have shown remarkable progress in robotic manipulation by leveraging the powerful perception abilities of Vision-Language Models (VLMs) to understand environments and directly output actions. However, by default, VLA models may overly attend to image tokens in the task-irrelevant region, which we describe as 'distracting tokens'. This behavior can disturb the model from the generation of the desired action tokens in each step, affecting the success rate of tasks. In this paper, we introduce a simple yet effective plug-and-play Distracting Token Pruning (DTP) framework, which dynamically detects and prunes these distracting image tokens. By correcting the model's visual attention patterns, we aim to improve the task success rate, as well as exploring the performance upper boundaries of the model without altering its original architecture or adding additional inputs. Experiments on the SIMPLER Benchmark (Li et al., 2024) show that our method consistently achieving relative improvements in task success rates across different types of novel VLA models, demonstrating generalizability to transformer-based VLAs. Further analysis reveals a negative correlation between the task success rate and the amount of attentions in the task-irrelevant region for all models tested, highlighting a common phenomenon of VLA models that could guide future research. We also publish our code at: https://anonymous.4open.science/r/CBD3.
