Skip to content
Preprint

Verify, Act, Distill: Turning Test-Time Compute into Test-Time Adaptation for Vision-Language-Action Models

Oct 2026 · 0 citations · 48 references
Computer Science

TL;DR

Verify, Act, Distill, a framework that consolidates the gains of TTC into the VLA itself, shows 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.

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.

View source

Similar papers

#machine learning Preprint Oct 2026

NestedVLA: Learning to Consolidate and Generate Skills for Vision-Language-Action Models

Vision-language-action (VLA) models can learn a wide range of robotic skills, but combining separately trained skills remains challenging. The original training data may be unavailable for joint retraining, while directly merging model weights can cause interference. We propose NestedVLA, which consolidates independent...

Guo-Dong Du, Wan-Yu Lin · 1 citation
Preprint Sep 2026

AutoPruner: Agentic Depth Pruning for Vision-Language-Action Models

Layer pruning reduces the size and inference cost of vision-language-action (VLA) models, but selecting a deployable configuration requires deciding both which layers to remove and how to recover task performance. These decisions depend on the model and task, and a failed trial can reflect either the deletion set or in...

Tao Lin, Yi-Keng Chen, Qi-Wei Liang et al. · 0 citations
Preprint Nov 2026

Same Path, Less Time: Training-Free Fast Execution of Vision-Language-Action Models under Inference Latency

Vision-language-action (VLA) models predict chunks of future actions, yet deployed robots waste time in two ways that are independent of model capability: they halt while the next chunk is inferred, and they move at the speed of slow, cautious demonstrations. Existing remedies remove one loss each, and stacking them fa...

Fu-Yi Chen · 0 citations
#machine learning Preprint Oct 2026

Policy-Aligned Predictive Verification for Adaptive VLA Action-Chunk Execution

This work introduces a policy-aligned predictive verifier (PAV) that anticipates the consequences of candidate action prefixes and evaluates their compatibility with successful continuation before execution, and combines trajectory-level survival supervision with a localization prior that preserves useful behavior with...

Minkyu Kim, Junhoo Lee, Seungyeon Kim et al. · 0 citations
Preprint Oct 2026

VeriVLA: Adaptive Test-Time Verification for Flow-Based VLAs with Latent World Models

Flow-based Vision-Language-Action (VLA) policies are inherently stochastic: different noise seeds can produce action chunks of varying quality from the same observation. At test time, however, the policy typically commits to a single sample without an explicit estimate of its quality. In fine-grained manipulation, exec...

Xue-Li Sun, Yuxiang Lu, Yan-Tong Liu et al. · 0 citations
#machine learning Preprint Oct 2026

ASCENT: Online Test-Time Training of Long-Horizon Agents via Self-Distillation of Verified Experience

ASCENT improves task success and interaction efficiency as experience accumulates, outperforms online adaptation methods, and transfers to held-out scenes, showing that an agent can consolidate verified experience into its weights without a separate training phase or memory retrieval.

Hao-Dong Lu, Dong Gong · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.