VLA-ACL: Can Token Pruning Speed Up Robot Manipulation?
transcript
show notes
Can a VLA discard most visual tokens without changing what the robot does? This episode examines VLA-ACL's action-supervised pruning method and separates its demonstrated compression benefits from its deployment assumptions. We cover three questions: why the larger token budget is the more convincing reliability trade-off; how preserving rotary positions changes the strength of attention-based baselines; and why a language-backbone speedup is not automatically a camera-to-command speedup. The method trains a separate selector while keeping the task-adapted VLA frozen, using both teacher predictions and demonstrated actions. (github.com) We discuss LIBERO simulation, physical manipulation on an AgileX PiPER-X, and the limits of interpreting those experiments as generalization evidence. The most important limitation is the scope of the efficiency measurement: deployment gains require complete-pipeline profiling, not just backbone timing. (arxiv.org) We also inspect the released code and checkpoints, including a training-configuration provenance discrepancy, and develop a practical evaluation plan covering instruction changes, visual disturbances, matched baselines, and failure costs. Before trading visual context for lower latency, how would you establish that the saved milliseconds are worth the additional control risk?