Verify, Act, Distill: Turning Test-Time Compute into Test-Time Adaptation for Vision-Language-Action Models
cs.RO
Submitted: 2026-10-10
Updated: 2026-10-10
License: http://creativecommons.org/licenses/by/4.0/
The gist: Test-time compute (TTC), which scores multiple candidate actions at inference time, is a powerful way to improve the execution performance of vision-language-action (VLA) models, but existing methods
Terminology
Abstract
Test-time compute (TTC), which scores multiple candidate actions at inference time, is a powerful way to improve the execution performance of vision-language-action (VLA) models, but existing methods keep the policy frozen, so the gain must be recomputed at every execution. We propose Verify, Act, Distill, a framework that consolidates the gains of TTC into the VLA itself. A fixed verifier scores candidates generated by a flow-matching VLA, the weighted aggregate is executed, and the observations and aggregated chunks from successful adaptation episodes are distilled directly into LoRA parameters with the standard flow-matching loss. This reuses supervision that TTC has already produced during execution, without additional reinforcement learning or rollouts dedicated to teacher generation. On the 40 LIBERO tasks with a SmolVLA 5k checkpoint, distilling from only 10 episodes per task raises the mean success rate of verifier-free single-candidate generation from 54.1% to 70.6%, retaining about 74% of the improvement obtained by aggregating eight candidates. Applying the same aggregation to the distilled policy further raises the success rate from 76.4% to 82.3%, with a particularly large gain on LIBERO-Long (44.0% to 57.8%), and the single-candidate policy also improves on LIBERO-plus, which contains distribution shifts. These results show that using verification as a learning signal, rather than only as an execution-time selector, both retains the improvements of TTC and re-amplifies the effect of subsequent TTC.
Sources
- Thinking Fast and Slow with Deep Learning and Tree Search
- EVOLVE-VLA: Test-Time Training from Environment Feedback for Vision-Language-Action Models
- SARM2: Multi-Task Stage Aware Reward Modeling for Self Improving Robotic Manipulation
- ConRFT: A Reinforced Fine-tuning Method for VLA Models via Consistency Policy
- TGRPO :Fine-tuning Vision-Language-Action Model via Trajectory-wise Group Relative Policy Optimization
- Diffusion Policy: Visuomotor Policy Learning via Action Diffusion
- SCALE: Self-uncertainty Conditioned Adaptive Looking and Execution for Vision-Language-Action Models
- RoVer: Robot Reward Model as Test-Time Verifier for Vision-Language-Action Model
- EXPO-FT: Sample-Efficient Reinforcement Learning Finetuning for Vision-Language-Action Models
- EXPO: Stable Reinforcement Learning with Expressive Policies
- LIBERO-Plus: In-depth Robustness Analysis of Vision-Language-Action Models
- VLA-Reasoner: Empowering Vision-Language-Action Models with Reasoning via Online Monte Carlo Tree Search
- LoRA: Low-Rank Adaptation of Large Language Models
- $\pi_{0.5}$: a Vision-Language-Action Model with Open-World Generalization
- Verifier-free Test-Time Sampling for Vision-Language-Action Models
- Refined Policy Distillation: From VLA Generalists to RL Experts
- DEAS: DEtached value learning with Action Sequence for Scalable Offline RL
- RoboMonkey: Scaling Test-Time Sampling and Verification for Vision-Language-Action Models
Related papers
- FMT x: An Efficient and Asymptotically Optimal Extension of the Fast Marching Tree for Dynamic Replanning
- MPCFormer: A physics-informed data-driven approach for explainable socially-aware autonomous driving
- RoboLab: A High-Fidelity Simulation Benchmark for Analysis of Task Generalist Policies
- ARC: A Reasoning Recipe for Robot Foundation Models
- HRDexDB: A 4D Dexterous Grasping Dataset Across Human and Multiple Robot Embodiments
- APT: Action Expert Pretraining Improves Instruction Generalization of Vision-Language-Action Policies