HyperAIHyperAI

Command Palette

Search for a command to run...

VLA-Corrector: 적응형 행동 지평을 위한 경량 감지-및-수정 추론

초록

비전-언어-행동(VLA) 기반 모델은 최근 체화 지능 분야에서 큰 진전을 이루었다. 정책 호출 빈도를 줄이면서 시간적 일관성을 유지하기 위해, 대부분의 생성형 정책은 행동 청크 메커니즘을 채택하여 고정된 행동 지평 아래에서 여러 미래 행동을 개방 루프 방식으로 실행한다. 그러나 이러한 '예측 후 무조건 실행' 패러다임은 폐쇄 루프 반응성을 희생한다. 접촉이 많은 물리적 상호작용에서는 작은 국소적 섭동조차 개방 루프 사각지대 내에서 빠르게 증폭되어 누적 오류를 일으키고 결국 작업 실패로 이어질 수 있다. 이러한 한계를 해결하기 위해, 우리는 행동 청크 기반 VLA 정책을 위한 경량 수정 추론 프레임워크인 VLA-Corrector를 제안한다. VLA-Corrector는 백본 정책 가중치를 수정하지 않고, 경량 잠재 공간 비전 모니터(LVM)를 도입하여 예측된 시각 특징 변화와 실제 변화를 지속적으로 비교함으로써 시각 역학 편차를 온라인으로 감지한다. 지속적인 편차가 감지되면 시스템은 중단 이벤트를 트리거하고 남은 오래된 행동을 폐기한 후, 온라인 기울기 안내(OGG)를 통해 수정 재계획을 호출한다. VLA-Corrector의 감지-및-수정 메커니즘은 자연스럽게 이벤트 트리거 방식의 적응형 행동 지평을 유도한다. 현재 청크가 신뢰할 수 있는 상태로 유지될 때는 긴 지평 실행을 보존하고, 실행이 표류하기 시작하면 짧은 지평의 수정 재계획을 호출한다. 이를 통해 VLA-Corrector는 정적 지평이 부과하는 실행 견고성과 정책 호출 빈도 간의 절충을 완화한다. 이 프레임워크는 VLA 백본을 추가로 재학습하지 않고도 다양한 VLA 모델에 통합될 수 있으며, 행동 청킹의 효율성 이점을 대부분 유지하면서 누적 오류를 차단하고 긴 지평의 접촉이 많은 로봇 조작 작업에서 견고성을 크게 향상시킨다.

One-sentence Summary

Zhejiang University and Alibaba DAMO Academy propose VLA-Corrector, a lightweight detect-and-correct inference framework that augments action-chunked VLA policies with a Latent-space Vision Monitor for online detection of visual dynamics deviations and Online Gradient Guidance for corrective replanning, enabling event-triggered adaptive action horizons without retraining the backbone policy, interrupting compounding errors while preserving the efficiency of action chunking and substantially improving robustness in long-horizon, contact-rich robotic manipulation tasks.

Key Contributions

  • This work quantifies the performance–efficiency trade-off imposed by fixed action horizons in action-chunked VLA policies, showing that the open-loop blind spot consistently degrades robustness across different VLA backbones.
  • VLA-Corrector is introduced as a lightweight inference-time framework that integrates a Latent-space Vision Monitor for online drift detection, event-triggered truncation of stale actions, and Online Gradient Guidance to steer corrective replanning without altering the VLA backbone.
  • Simulation and real-world experiments show that on π₀.₅ at horizon 50, VLA-Corrector raises success from 48.7% to 58.7% while slightly reducing policy calls, yielding a +24.6% success-per-call efficiency gain, and enables a few-shot fine-tuned model to reach 97.8% average success on LIBERO, surpassing the fully fine-tuned baseline.

Introduction

The authors examine vision-language-action (VLA) foundation models for robot control, which often rely on action chunking to amortize the high latency of generative action policies. This chunking creates an open-loop blind spot where the robot executes a fixed number of predicted actions without responding to fresh observations, leaving it vulnerable to compounding errors and task failure. They propose VLA-Corrector, a lightweight inference-time module that continuously monitors latent-space visual dynamics to detect execution drift, truncates stale action chunks early, and then applies gradient-guided re-inference to steer the robot back toward the intended trajectory. This turns a fixed action horizon into an adaptive one, preserving the efficiency of long chunks while regaining short-horizon reactivity, all without retraining the underlying VLA model.

Method

The main limitation that VLA-Corrector targets is the open-loop blind spot inherent in action-chunked VLA policies. In such policies, the visual encoder processes observation oto_tot into a latent ZtrealZ_t^{\mathrm{real}}Ztreal, and the policy outputs an action chunk AtA_tAt containing multiple future actions. During the action horizon, the controller executes the first HHH actions without re-querying the policy, even though fresh visual observations become available. This creates a window where the executed actions may drift from the intended trajectory without any corrective mechanism.

VLA-Corrector addresses this by decoupling action generation from execution monitoring. The core idea is to keep the VLA backbone for action chunk generation while adding a lightweight external dynamics corrector that monitors online visual consistency and triggers corrective replanning only when persistent drift is detected. The framework consists of four tightly integrated modules: (1) training an external latent dynamics corrector, (2) Latent-space Vision Monitor (LVM) for online anomaly detection, (3) event-triggered truncation, and (4) Online Gradient Guidance (OGG) for corrective inference.

The external latent dynamics corrector MϕM_\phiMϕ is trained after the VLA policy has been fine-tuned and frozen. Using the VLA’s visual encoder, the authors extract latent representations from demonstration trajectories. For a transition (ot,at,ot+k)(o_t, a_t, o_{t+k})(ot,at,ot+k), they compute the true short-horizon visual latent evolution:

ΔZt+k=Zt+krealZtreal,\Delta Z_{t+k}^{*} = Z_{t+k}^{\mathrm{real}} - Z_t^{\mathrm{real}},ΔZt+k=Zt+krealZtreal,

and train a lightweight MLP MϕM_\phiMϕ to predict this residual from the current latent state and the executed action:

ΔZ^t+k=Mϕ(Ztreal,at).\Delta \hat{Z}_{t+k} = M_\phi(Z_t^{\mathrm{real}}, a_t).ΔZ^t+k=Mϕ(Ztreal,at).

The objective encourages both magnitude matching and directional consistency:

Lcorr=ΔZ^t+kΔZt+k22+β[1CosSim(ΔZ^t+k,ΔZt+k)].\mathcal{L}_{\mathrm{corr}} = \big\| \Delta \hat{Z}_{t+k} - \Delta Z_{t+k}^{*} \big\|_2^2 + \beta \big[1 - \operatorname{CosSim}(\Delta \hat{Z}_{t+k}, \Delta Z_{t+k}^{*})\big].Lcorr=ΔZ^t+kΔZt+k22+β[1CosSim(ΔZ^t+k,ΔZt+k)].

Predicting residuals instead of absolute latents suppresses static scene content and forces the model to focus on task-relevant dynamics. The corrector is a small module (around 40M parameters in the authors’ experiments) trained solely on demonstration data, which makes it cheap to train and reusable across different benchmarks without touching the expensive VLA backbone.

During deployment, the Latent-space Vision Monitor (LVM) leverages the trained corrector to detect online deviations. At control step ttt, LVM uses the executed action ata_tat and the current latent state to compute the expected latent evolution ΔZt+kexp=Mϕ(Ztreal,at)\Delta Z_{t+k}^{\exp} = M_\phi(Z_t^{\mathrm{real}}, a_t)ΔZt+kexp=Mϕ(Ztreal,at). It then compares this with the actual latent evolution ΔZt+kreal=Zt+krealZtreal\Delta Z_{t+k}^{\mathrm{real}} = Z_{t+k}^{\mathrm{real}} - Z_t^{\mathrm{real}}ΔZt+kreal=Zt+krealZtreal obtained from the fresh camera observation, yielding an inconsistency score:

Et=1CosSim(ΔZt+kexp,ΔZt+kreal).E_t = 1 - \operatorname{CosSim}\big(\Delta Z_{t+k}^{\exp}, \Delta Z_{t+k}^{\mathrm{real}}\big).Et=1CosSim(ΔZt+kexp,ΔZt+kreal).

A higher EtE_tEt indicates a stronger mismatch between expected and observed visual dynamics, serving as a continuous monitoring signal.

Rather than thresholding EtE_tEt directly, which would be sensitive to transient outliers, the authors employ a robust event-triggered truncation rule. A sliding window of recent scores EW\mathbf{E}_WEW is maintained, and its median MeM_eMe and median absolute deviation MAD\mathrm{MAD}MAD are computed. Two adaptive thresholds are defined:

Ton=Me+λonMAD,Toff=Me+λoffMAD,λon>λoff.T_{\mathrm{on}} = M_e + \lambda_{\mathrm{on}}\mathrm{MAD},\quad T_{\mathrm{off}} = M_e + \lambda_{\mathrm{off}}\mathrm{MAD},\quad \lambda_{\mathrm{on}} > \lambda_{\mathrm{off}}.Ton=Me+λonMAD,Toff=Me+λoffMAD,λon>λoff.

An interrupt is triggered only when Et>TonE_t > T_{\mathrm{on}}Et>Ton persists for ppp consecutive steps, effectively filtering out isolated spikes while detecting sustained drift. Once triggered, the system discards the remaining actions in the current queue and initiates a corrective replan. The effective action horizon becomes Hadaptive=h<HH_{\mathrm{adaptive}} = h < HHadaptive=h<H, where hhh is the number of already executed steps, thereby shortening the fixed horizon only when the chunk has truly become stale.

Corrective replanning after truncation is performed by Online Gradient Guidance (OGG), applied exclusively to the policy call immediately following the interrupt. OGG guides the flow-matching denoising process toward a latent direction that compensates for the accumulated drift. At denoising step τ\tauτ, a candidate clean action a^t\hat{a}_ta^t is estimated from the noisy chunk, and its predicted latent effect is ΔZ^act=Mϕ(Ztreal,a^t)\Delta \hat{Z}_{\mathrm{act}} = M_\phi(Z_t^{\mathrm{real}}, \hat{a}_t)ΔZ^act=Mϕ(Ztreal,a^t). A corrective target ΔZcorr\Delta Z_{\mathrm{corr}}ΔZcorr is defined as the difference between the expected residual from the last stable step tkt-ktk and the accumulated deviation ΔZdev=ZtrealZtkreal\Delta Z_{\mathrm{dev}} = Z_t^{\mathrm{real}} - Z_{t-k}^{\mathrm{real}}ΔZdev=ZtrealZtkreal:

ΔZcorr=ΔZexpΔZdev.\Delta Z_{\mathrm{corr}} = \Delta Z_{\exp} - \Delta Z_{\mathrm{dev}}.ΔZcorr=ΔZexpΔZdev.

The guidance loss measures the directional mismatch between the predicted action effect and the corrective target:

LOGG=1CosSim(ΔZ^act,ΔZcorr).\mathcal{L}_{\mathrm{OGG}} = 1 - \operatorname{CosSim}(\Delta \hat{Z}_{\mathrm{act}}, \Delta Z_{\mathrm{corr}}).LOGG=1CosSim(ΔZ^act,ΔZcorr).

The gradient of this loss is injected into the flow-matching velocity field:

vτguide=vτηvτLOGG,AτΔτ=AτΔτvτguide.v_\tau^{\text{guide}} = v_\tau - \eta \nabla_{v_\tau} \mathcal{L}_{\mathrm{OGG}},\quad A^{\tau - \Delta\tau} = A^\tau - \Delta\tau \, v_\tau^{\text{guide}}.vτguide=vτηvτLOGG,AτΔτ=AτΔτvτguide.

Because OGG adjusts the velocity field rather than directly manipulating action coordinates, the corrective replanning remains smoothly integrated with the original flow-matching generative process.

Overall, VLA-Corrector forms a lightweight, modular corrective inference system that sits alongside a frozen VLA policy. It monitors latent dynamics online, truncates unreliable action chunks adaptively, and guides recovery replanning toward a consistent trajectory without retraining the main policy.

Experiment

The evaluation of VLA-Corrector across three simulation benchmarks and a real robot, using multiple VLA backbones, validates its cross-architecture robustness, sample and data efficiency, mechanism, and real-world transfer. The method consistently improves success rates and policy-call efficiency by interrupting stale action chunks early and guiding corrective replanning, with the largest gains on hard tasks and under online disturbances. Mechanistic studies confirm that the detection signal isolates critical error-prone phases while the recovery module enhances post-truncation replanning, and ablations show that decoupled monitoring and moderate data and model sizes suffice.

VLA-Corrector consistently improves success rates across all three VLA backbones on MetaWorld, with larger gains on harder difficulty splits. The average improvement is largest for π0.5 at 15.65 percentage points, driven by a 24-point jump on the Very Hard split. SmolVLA and X-VLA also benefit, achieving average gains of 4.75 and 4.05 points respectively. VLA-Corrector boosts all backbones and achieves its largest absolute improvements on harder tasks, such as the Very Hard split for π0.5. For π0.5, the Very Hard success rate rises from 41.0% to 65.0%, a 24-percentage-point gain. The average improvement ranges from 15.65 points for π0.5 to 4.05 points for X-VLA, demonstrating benefits that scale with backbone baseline performance.

On the LIBERO benchmark, adding VLA-Corrector to a few-shot fine-tuned policy lifts average success from 94.00% to 97.80%, exceeding the fully fine-tuned baseline of 96.95%. The improvement is strongest on long-horizon and spatial tasks, showing that the corrector compensates for limited task-specific data by enabling recovery from execution drift. VLA-Corrector boosts the few-shot policy above the fully fine-tuned model, reaching 97.80% average success. Long-horizon task success jumps from 86.6% to 93.4%, the largest absolute gain among task categories. Spatial tasks achieve perfect 100.0% success after correction, up from 95.4%.

Training the corrector on more demonstration data steadily improves average success over the open-loop baseline. Using the full training split (after validation hold-out) yields the largest gain, while even 60% of the data already delivers most of the benefit, and very low data (20%) slightly underperforms the baseline. With only 20% of the training split, the corrector averages 48.32%, marginally below the baseline's 48.72%. Using the full held-in training split (r=1.0) pushes average success to 54.32%, a 5.60-point improvement, with gains concentrated in medium and hard tasks.

Across both backbones and all action horizons, VLA-Corrector raises task success while typically reducing the average number of policy calls per episode. The largest efficiency gain appears for SmolVLA at the shortest horizon, and improvements remain positive even in the rare case where call counts rise slightly. For SmolVLA with a 10-step horizon, success jumps by 11.1 percentage points and calls drop by 3.63, yielding a 45.3% relative success-per-call efficiency gain. At horizon 40 on π₀.₅, call count increases marginally yet the method still delivers a 10.2% efficiency gain due to a 6.35-point success improvement.

Truncations that trigger corrective re-inference are concentrated in critical task phases, where precision matters most. More than four out of every five truncations occurred during these segments, at a rate over five times higher than in non-critical phases, showing that the interruption mechanism is selective about when to discard stale actions. Over 80% of truncations happened in critical task phases. Truncations were 5.1× more common in critical phases than in non-critical ones.

VLA-Corrector was evaluated on MetaWorld and LIBERO benchmarks across multiple VLA backbones, few-shot and fully fine-tuned policies, varying training data sizes, and different action horizons. It consistently improves task success rates, with the largest gains on harder difficulty splits and long-horizon tasks, and can lift a few-shot policy above a fully fine-tuned baseline. The corrective mechanism also enhances efficiency by reducing the number of policy calls per episode, and its truncations are selectively triggered during critical task phases where precise actions are most needed.


AI로 AI 구축

아이디어에서 출시까지 — 무료 AI 코코딩, 즉시 사용 가능한 환경, 최적의 GPU 가격으로 AI 개발을 가속화하세요.

AI 협업 코딩
바로 사용 가능한 GPU
최적의 가격

HyperAI Newsletters

최신 정보 구독하기
한국 시간 매주 월요일 오전 9시 에 이번 주의 최신 업데이트를 메일로 발송합니다
이메일 서비스 제공: MailChimp