Leveraging Offline Supervision for Efficient and Generalizable Reinforcement Learning in Large-Scale Vision-Language-Action Models

· Source: cs.CV updates on arXiv.org · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Robotics & Autonomous Systems · Depth: Expert, extended

Summary

A recent study investigates hybrid offline-online training for large-scale vision-language-action (VLA) models, specifically OpenVLA with LoRA adapters, to combine the out-of-distribution (OOD) generalization of online reinforcement learning (RL) with the efficiency of offline methods. The research evaluates two PPO variants: RefKL, which regularizes the policy towards a frozen supervised fine-tuning (SFT) reference model via a Kullback–Leibler penalty, and DataBC, which augments PPO with behavior cloning on an offline dataset. Results demonstrate that these guided methods achieve OOD performance comparable to standard RL policies trained for 2 million environment steps, but require only 1 million steps, effectively halving the training budget. Stronger initial auxiliary supervision consistently improved success rates, and a curriculum schedule for the regularization weight proved more efficient than a constant value.

Key takeaway

For Machine Learning Engineers developing large-scale vision-language-action (VLA) models, you should integrate offline supervision into your reinforcement learning (RL) fine-tuning pipeline. Specifically, consider using reference-policy guided PPO (RefKL) with a curriculum schedule for the regularization weight. This approach can halve your online training budget while maintaining robust out-of-distribution performance, making RL fine-tuning more viable for real-world robotic applications. Avoid simply initializing PPO from an SFT model, as it adapts slower.

Key insights

Offline supervision significantly boosts RL training efficiency for VLA models while preserving strong out-of-distribution generalization.

Principles

Method

Augment Proximal Policy Optimization (PPO) with auxiliary losses: either a Kullback–Leibler (KL) penalty to a frozen SFT reference policy (RefKL) or behavior cloning (BC) on an offline dataset (DataBC). Use a curriculum schedule for the regularization weight.

In practice

Topics

Best for: Computer Vision Engineer, Research Scientist, AI Scientist, Machine Learning Engineer, Robotics Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by cs.CV updates on arXiv.org.