Reinforcement Fine-Tuning of Flow-Matching Policies for Vision-Language-Action Models
Mingyang Lyu, Yinqian Sun, Erliang Lin, Huangrui Li, Ruolin Chen, Feifei Zhao, Yi Zeng
TL;DR
Vision-Language-Action models pretrained via demonstrations are powerful but constrained by data quality; online reinforcement fine-tuning is hindered by intractable density ratios for flow-based policies. Flow Policy Optimization (FPO) introduces a likelihood-free policy ratio derived from per-sample changes in the conditional flow-matching objective, combined with structure-aware credit assignment, a clipped surrogate, multi-step latent exploration, and a Q-ensemble to enable stable online RL of the $\pi_0$ policy. Across LIBERO and ALOHA benchmarks, $\pi_0$-FPO surpasses six strong baselines, with ablations validating each component and latent-space analyses revealing a shift from broad exploration to focused, high-value control. The approach demonstrates practical, scalable online adaptation for high-frequency, long-horizon visuomotor control in sparse-reward, contact-rich tasks, enabling stronger generalization beyond imitation data.
Abstract
Vision-Language-Action (VLA) models such as OpenVLA, Octo, and $π_0$ have shown strong generalization by leveraging large-scale demonstrations, yet their performance is still fundamentally constrained by the quality and coverage of supervised data. Reinforcement learning (RL) provides a promising path for improving and fine-tuning VLAs through online interaction. However, conventional policy gradient methods are computationally infeasible in the context of flow-matching based models due to the intractability of the importance sampling process, which requires explicit computation of policy ratios. To overcome this limitation, we propose Flow Policy Optimization (FPO) algorithm, which reformulates importance sampling by leveraging per-sample changes in the conditional flow-matching objective. Furthermore, FPO achieves stable and scalable online reinforcement fine-tuning of the $π_0$ model by integrating structure-aware credit assignment to enhance gradient efficiency, clipped surrogate objectives to stabilize optimization, multi-step latent exploration to encourage diverse policy updates, and a Q-ensemble mechanism to provide robust value estimation. We evaluate FPO on the LIBERO benchmark and the ALOHA simulation task against supervised, preference-aligned, diffusion-based, autoregressive online RL, and $π_0$-FAST baselines, observing consistent improvements over the imitation prior and strong alternatives with stable learning under sparse rewards. In addition, ablation studies and analyses of the latent space dynamics further highlight the contributions of individual components within FPO, validating the effectiveness of the proposed computational modules and the stable convergence of the conditional flow-matching objective during online RL.
