VGAS+: Value-Guided Action-Chunk Selection and Refinement

Preprint · 2026
Changhua Xu  ·  En Yu  ·  Junyu Xuan  ·  Jie Lu
Australian Artificial Intelligence Institute (AAII), University of Technology Sydney
VGAS  ·  arXiv 2602.07399   |   VGAS+  ·  coming soon

Abstract

Vision–Language–Action (VLA) models bridge multimodal reasoning with physical control, but adapting them to new tasks with scarce demonstrations remains unreliable. While few-shot SFT policies often produce semantically plausible action chunks, small geometric errors can lead to divergent execution outcomes. We study few-shot VLA adaptation from a value-guided policy improvement perspective, learning a long-horizon critic over temporally extended action chunks. At the core of our approach is the Q-Chunk-Former, a geometrically grounded Transformer critic that maps vision–language observations and proprioceptive states to chunk-level values. To train this critic under scarce demonstrations, we introduce Explicit Geometric Regularization (EGR), which shapes a discriminative value landscape and preserves ranking resolution among near-miss action candidates. Building on this critic, VGAS performs inference-time Best-of-N selection by keeping the SFT policy fixed and executing the candidate chunk with the highest predicted return. We then introduce VGAS+, which extends VGAS with post-training policy extraction: it optimizes candidate chunks in action space and distills the critic-refined targets into the VLA through its native supervised generative objective, avoiding direct critic backpropagation through the flow-matching-based action head. Experiments on LIBERO and MetaWorld, together with theoretical analysis, show that VGAS improves fixed-policy execution, while VGAS+ further outperforms evaluated SFT and offline RL baselines under limited demonstrations.

Overview

Framework overview: (a) shared Q-Chunk-Former critic trained with TD + EGR, (b) VGAS inference-time Best-of-N selection, (c) VGAS+ post-training policy extraction
Overview of the critic-centric framework. A shared Q-Chunk-Former critic drives both inference-time selection (VGAS) and post-training policy extraction (VGAS+).

Results

LIBERO · 5-shot per task (success rate, %)

MethodSpatialObjectGoalLongAvg.ΔAvg.
SmolVLA (SFT)46.045.852.015.539.8—
π0 (SFT, 3.5B)66.071.178.043.864.7—
QC-M+CQL (Best-of-N)47.850.354.216.542.2+2.4
VGAS (ours, Best-of-N)56.259.060.820.049.0+9.2
QC-FQL-T (extraction)61.753.960.118.148.4+8.6
VGAS+ (ours, extraction)77.777.883.841.870.3+30.5

MetaWorld · 5-shot per task (success rate, %)

MethodEasyMediumHardVery-HardAvg.
SmolVLA (SFT)56.117.37.819.025.0
π0 (SFT, 3.5B)66.329.829.640.041.4
QC-FQL-T (extraction)56.519.430.038.536.1
VGAS (ours, Best-of-N)56.519.79.720.726.6
VGAS+ (ours, extraction)71.530.936.138.344.2

All values from the paper (mean over 6 evaluation seeds, 50 episodes per task per seed). With a 0.45B SmolVLA base, VGAS+ surpasses the 3.5B π0 on average on both benchmarks. Full comparisons and ablations in the paper.

Rollout comparisons

Each row is one initial state played by all three methods at the same playback speed, so the pace you see is real. Successful runs hold on their final frame.

“put the yellow and white mug in the microwave and close it”

BC
failuredid not finish
VGAS
success261 steps
VGAS+
success247 steps

“put the bowl on top of the cabinet”

BC
failuredid not finish
VGAS
success94 steps
VGAS+
success94 steps

“pick up the bbq sauce and place it in the basket”

BC
failuredid not finish
VGAS
success195 steps
VGAS+
success120 steps

“put both the alphabet soup and the tomato sauce in the basket”

BC
failuredid not finish
VGAS
failuredid not finish
VGAS+
success274 steps

Analysis

Selection concentrates the policy; extraction internalizes it

Action distribution, projection 1
Action distribution, projection 2
Action distribution, projection 3
Candidate chunks in three projected action subspaces. The SFT policy's proposals (blue) sprawl around the demonstrations (red). Critic-selected chunks (orange) concentrate toward them — this is VGAS at inference time. After policy extraction, the refined policy samples (purple) land there directly, which is why VGAS+ needs no reranking at deployment.

Cost of the value guidance

Success rate versus per-decision-step latency
Success rate versus peak CUDA memory
Best-of-N selection buys accuracy with inference cost, and saturates around N=8. VGAS+ moves the value signal into training instead: it reaches the highest success rate at single-sample inference cost — no critic, no reranking at deployment.

BibTeX

@article{xu2026vgas,
  title   = {VGAS: Value-Guided Action-Chunk Selection for Few-Shot
             Vision-Language-Action Adaptation},
  author  = {Xu, Changhua and Yu, En and Xuan, Junyu and Lu, Jie},
  journal = {arXiv preprint arXiv:2602.07399},
  year    = {2026}
}

% VGAS+ — preprint coming soon.
% The citation entry will be added here once it is online.