用价值梯度匹配让离线训练的视觉语言动作模型快速在线优化,无需反向传播或推理时的评判器。
Q-VGM: Q-Value-Gradient Matching for Offline-to-Online Reinforcement Learning of Flow-Matching VLA

- 用动作敏感的分块评判器指导去噪动态的最优控制,避免反向传播通过多步去噪过程
- 在LIBERO数据集上仅用150次任务采样,成功率从86.9%提升至93.0%,接近PPO但节省6倍采样
- 真实双臂操作任务成功率从66.7%升至98.3%,适合少样本、高成本的真实机器人应用
我们提出Q-引导价值梯度匹配(Q-VGM),一种用于微调基于流匹配的视觉语言动作(VLA)策略的离线到在线强化学习方法。经典离策略演员-评论家方法通过评论家梯度∇ₐQ改进策略,但应用于流策略需对多步去噪过程进行反向传播(BPTT),在大规模VLA场景下代价高且不稳定。现有无BPTT方法多将策略改进简化为通过过滤或重加权行为样本的评论器监督模仿学习,或依赖测试时选择与引导,使底层策略不变。Q-VGM则将策略改进表述为对去噪动态的最优控制,其中最优残差速度即为去噪时间价值函数的梯度。具体地,我们在冻结的VLA骨干网络提取的紧凑潜空间上训练动作敏感的分块评论器,离线阶段使用IQL,线上阶段使用TD学习。通过迭代Q梯度上升获得干净的动作估计,并转化为残差速度目标直接监督速度场。训练避免了动作似然估计和BPTT问题,且推理时无需评论器。从LIBERO上的少样本微调π₀.₅策略出发,离线Q-VGM将空间、物体和目标任务的平均成功率从86.9%提升至93.0%,每任务仅150次采样。离线到在线阶段达到99.7%,性能媲美PPO微调但采样量减少约6倍。在三个真实世界双臂操作任务中,平均成功率从66.7%提升至98.3%。
原文摘要 · Abstract (English)
We propose Q-Guided Value-Gradient Matching (Q-VGM), an offline-to-online reinforcement learning (RL) method for fine-tuning flow-matching vision-language-action (VLA) policies with a learned Q-function. Classical off-policy actor-critic methods improve a policy by following the critic gradient $\nabla_A Q$, but applying this update to flow policies requires backpropagation through the multi-step denoising process (BPTT), which is costly and unstable at VLA scale. Existing BPTT-free approaches mostly reduce policy improvement to critic-supervised imitation learning through filtering or reweighting sampled behaviors, or rely on test-time selection and guidance, leaving the underlying policy unchanged. Q-VGM instead formulates policy improvement as optimal control over the denoising dynamics, where the optimal residual velocity is the gradient of a denoising-time value function. Specifically, we train an action-sensitive chunk critic on compact latent states from the frozen VLA backbone, with IQL in the offline phase and TD learning in the online phase. Clean-action estimates improved by iterative Q-gradient ascent are then converted into residual velocity targets that directly supervise the velocity field. Training thus avoids both action-likelihood estimation and the BPTT problem, while requiring no critic at inference time. Starting from a few-shot-SFT $π_{0.5}$ policy on LIBERO, offline Q-VGM improves the average success rate across Spatial, Object and Goal suites from 86.9% to 93.0% with 150 rollout episodes per task. The offline-to-online phase reaches 99.7%, matching the final performance of PPO fine-tuning with approximately $6\times$ fewer rollout episodes. On three real-world bimanual manipulation tasks, offline Q-VGM improves the average success rate from 66.7% to 98.3%.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。