Organizations: SIGS, Tsinghua University, China · Wuhan University of Technology, China · Shanghai Jiao Tong University, China · University of Michigan - Ann Arbor, USA · AiDlab, Hong Kong (China SAR) · City University of Hong Kong, Hong Kong (China SAR)
Retrieval can efficiently and effectively augment a frozen vision--language--action (VLA) policy without retraining, yet retrieved text becomes a control intervention once it enters the executed prompt. In a matched audit, raw appended text reduces mean success from 92.47% to 3.00%, while meaningful and length-matched meaningless appends both fail on all 500 states. This result identifies prompt-form collapse: changing the instruction form, rather than adding useful semantics, can dominate execution. We introduce TOWN-VLA (Think Only When Needed), a prompt-authority interface that separates candidate generation from permission to alter the policy input. A fixed compatibility rule authorizes a canonical compact instruction; otherwise, the interface restores the original Base prompt exactly. Across 900 audited routes, every route follows this contract: 525 routes recover Base with matching hashes, and all 375 authorized prompts preserve the task signature. On a matched 4×7 LIBERO-Plus evaluation with 10{,}030 episodes per method, success rises from 69.5% to 73.1% (+362 episodes; 95% CI 1.89--5.45 points), improving on six perturbation axes and all four suites. On a physical PiPER arm with a frozen \pizerofive{} checkpoint, success rises from 52.7% to 78.7% over 150 trials per method (p=3.16×10−6). Prompt authority is enforceable for a frozen controller; oracle-free admission calibration is the next deployment target.
Figures & tables
Figure 1: Prompt authority at the frozen-policy boundary. Direct injection passes retrieved text to the VLA; TOWN-VLA (Think Only When Needed) authorizes a canonical capsule or restores Base while retaining the same frozen action generator.
Figure 2: TOWN-VLA separates invocation, candidate ranking, prompt authorization, and frozen control. Ranked contexts are checked and either rendered as a canonical capsule or rejected for exact Base restoration. Logged scores, flags, and prompt hashes make routes auditable. Task-Prior is used only for the oracle control in Equation ( 9 ).
Method
Setting
Camera
Robot
Language
Light
Background
Noise
Layout
Weighted Mean
OpenVLA
Direct
0.8
3.5
23.0
8.1
34.8
15.2
28.5
15.6
NORA
Direct
2.2
37.0
65.1
45.7
58.6
12.8
62.1
39.0
WorldVLA
Direct
0.1
27.9
41.6
43.7
17.1
10.9
38.0
25.0
UniVLA
Direct
1.8
46.2
69.6
69.0
81.0
21.2
31.9
42.9
π0
Flow policy
13.8
6.0
58.8
85.0
81.4
79.0
68.9
53.6
π0 -FAST
Autoregressive
65.1
21.6
61.0
73.2
73.2
74.4
68.8
61.6
Table 1: Seven-axis LIBERO-Plus SR (%). Published rows are from 10 ; the local OpenVLA-OFT and TOWN-VLA rows use the same frozen backbone, 28 cells, and 10,030 episodes per method.
Figure 3: Prompt-form collapse and retrieval-depth diagnostics. (a) Mean SR over three fixed-schedule repeats on one manifest (1,200 episodes per method and repeat); the Raw annotation is its change from matched Base. Compat. RR and Top-2 denote the reranked capsule and fail-closed cascade. (b) Paired Top- K results on 300 states with Wilson 95% intervals.
Variant
Task-prior
Capsule
Rerank
Fail-closed
SR (%)
Base Policy
–
–
–
–
89.48
Strategy Capsule (Top-1)
–
✓
–
–
90.64
Compatibility-Reranked Capsule
–
✓
✓
–
91.60
Top-2 Fail-Closed Cascade
–
✓
✓
✓
91.32
Complete Interface
✓
✓
✓
✓
91.32
Table 4: Interface and invocation controls. Complete Interface is TOWN-VLA. (a) Five-suite SR over 2,500 episodes per variant; checks mark enabled components. (b) Oracle routing on a separate paired-3,000 manifest, split equally between invoke and bypass.
Figure 4: Representative π0.5 /PiPER rollouts in the three evaluated scenes. Columns are time ordered; rows compare Base and TOWN-VLA, and red boxes mark interaction regions. Prompts resolve once; results use all 150 trials per method.
Vision-Language-Action (VLA) models trained on large-scale data have made remarkable progress, but they remain vulnerable to distribution shifts at deployment time. Recent VLA models suggest that prompts can serve as an efficient interface for steering policy behavior, but existing prompt-based steering typically relies on external guidance. This raises a natural question: can test-time training (TTT) for VLA be achieved by optimizing a prompt, so that the steering interface itself can be learned and adapted from interaction? We address this question with TTT-VLA, a test-time training framework based on Latent Prompt Optimization (LPO). During training, the latent prompt is learned with an additional proxy task, providing an extra learned conditioning signal for policy learning. At test time, TTT is performed by collecting interaction data from the current environment and optimizing only the latent prompt on those data using the proxy task's self-supervised signal, without modifying the policy itself. Experiments on SimplerEnv demonstrate that the proposed method consistently improves task success rates in both single- and multi-embodiment settings. Further analysis shows that the gains arise primarily from correcting a small number of critical decisions rather than globally altering policy behavior. These results suggest that LPO provides an effective and practical pathway for deployment-time improvement of foundation manipulation policies.
Wenbo Zhang, Jianxiong Li, Shuai Yang +4
ByteDance Seed · The University of Adelaide · Tsinghua University +3
Vision-Language-Action (VLA) models have become the dominant recipe for generalist manipulation, yet they are almost universally trained by behavior cloning: a policy imitates expert action chunks conditioned on a static image and a fixed instruction. A natural remedy is to inject explicit reasoning through textual chain-of-thought (CoT). We show, both empirically and analytically, that free-form textual CoT degrades low-level control: the reasoning it produces is ungrounded, its latency breaks closed-loop timing, and, crucially, the reasoning and action tokens are optimized against conflicting objectives so that the policy learns to narrate rather than to act. We argue that what a VLA needs is not the ability to generate language, but the ability to consume grounded language. To this end we introduce \ourmethod{}, a framework that endows a VLA with language competence through (i) in-context post-training, in which perceptual evidence is injected as structured context and the model is supervised only on actions, and (ii) an agentic tool-use interface, in which the policy queries open-vocabulary detectors, monocular depth, and a vision--language model to actively acquire task-relevant information. Rather than emitting a single templated caption, our data engine produces diverse, paraphrased, and evidence-conditioned spatial descriptions, so that the policy learns to interpret language it has never seen verbatim. Across the RoboCasa-GR1, SimplerEnv, and LIBERO simulation benchmarks, together with 8 real-world robot manipulation tasks, our method consistently achieves SOTA results in both performance and efficiency when compared with CoT-based approaches under matched configurations.
Jiarui Yang, Wen Huang, Jiale Zhang +2
Nankai University · Tsinghua University · Swiss Federal Institute of Technology in Lausanne (EPFL)
Vision-Language-Action (VLA) policies are typically evaluated under the assumption that the robot starts acting only after the user has finished typing or speaking. In real interactions, however, entering an instruction can take several seconds, leaving the policy idle for a substantial fraction of the interaction. Partial instructions may already contain sufficient information to begin acting before the full instruction arrives. We introduce Premover, a parameter-lightweight module that reduces interaction latency by overlapping instruction delivery with robot execution while keeping the VLA backbone frozen. Premover uses a learned vision-language focus map to identify where the current partial instruction refers in the visual scene, and an action readiness gate to determine when execution can begin. On the SO-101 robot with speech and online transcription, Premover reduces mean wall-clock time by 17.9%, from 60.5s to 49.7s, while maintaining task success rates. In simulation on LIBERO with pi0.5 at the speaking rate, Premover reduces mean wall-clock time by 8.3% while maintaining comparable success to waiting for the complete instruction before execution.
Joonha Park, Jiseung Jeong, Taesik Gong
UNIST, Ulsan, Republic of Korea · The Catholic University of Korea, Bucheon, Republic of Korea