ICML 2026 Workshop

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

Dmitriy Poyarkov1, Aleksei Staroverov1,2, Aleksandr I. Panov1,2
1AXXX 2MIRAI

Accepted at Decision-Making from Offline Datasets to Online Adaptation: Black-Box Optimization to Reinforcement Learning

Core idea of combining offline and online training

Hybrid offline-online training. The core idea of combining offline supervision with online RL fine-tuning: offline guidance is added directly to the PPO objective via RefKL or DataBC, not only as initialization.

Abstract

Online reinforcement learning (RL) can substantially improve vision–language–action (VLA) policies, especially under out-of-distribution (OOD) shifts, but requires costly environment interaction. Offline supervised fine-tuning (SFT) is cheaper yet OOD-limited. We study hybrid offline–online training that regularizes PPO with offline supervision from either a frozen SFT reference policy (RefKL) or offline demonstration data (DataBC). On the RL4VLA benchmark with LoRA-based OpenVLA adaptation, guided methods preserve strong OOD capability while reaching performance close to standard RL with roughly half the online training budget. Reference-policy guidance is the most consistent variant, showing that offline supervision acts as an effective optimization prior rather than merely a better initialization.

RefKLKL to frozen SFT policy
DataBCOffline BC auxiliary loss
~2×fewer online steps
OODgeneralization preserved

Why Hybrid Offline-Online RL?

Vision-language-action (VLA) policies can be trained offline from fixed demonstration datasets or online through environment interaction. In practice, online RL often produces stronger final policies and better out-of-distribution (OOD) behavior, but at substantially higher cost. Offline SFT remains cheaper and easier to deploy, yet struggles under distribution shift.

Recent work on RL4VLA showed that PPO fine-tuning of OpenVLA LoRA adapters can improve OOD performance relative to SFT, but requires much more expensive online training. This raises a practical question: in parameter-efficient VLA adaptation, can offline supervision be used not only for initialization, but as a structured signal inside the RL objective?

We study two guided PPO variants and one natural baseline:

  • RefKL — PPO regularized toward a frozen SFT reference policy via a KL penalty.
  • DataBC — PPO augmented with behavior cloning on the offline demonstration dataset.
  • PPO SFT-init — standard PPO initialized from the SFT LoRA without explicit guidance during RL.

Our central finding is that offline guidance acts as an effective optimization prior: guided methods improve over standard PPO at the same online budget, and RefKL reaches nearly the same operating point as a much longer PPO run while using far fewer environment interactions, without sacrificing OOD capability.

Task & Setup

We model control as a partially observable Markov decision process (POMDP). At each step the agent observes an RGB image and a natural-language instruction that remains fixed within an episode. The policy predicts tokenized actions that are converted by the environment wrapper into executed robot commands.

  • Horizon: fixed episode length of T = 80 steps.
  • Reward: sparse difference-based signal derived from task progress.
  • Backbone: frozen OpenVLA-warmup with a zero-initialized LoRA adapter (rank 32).
  • RL head: RL4VLA value-head modification for PPO training.
  • Training env: PutOnPlateInScene25Main-v3 on the RL4VLA benchmark.
  • SFT reference: early-stopped checkpoint trained on 2k demonstrations for 7.5k steps.

All methods share the same architecture and RL hyperparameters; only the training objective differs. This isolates the effect of offline supervision design rather than changes to the experimental protocol.

Method

All methods operate on the same pretrained OpenVLA-warmup backbone. During training the base VLA is frozen and only a LoRA adapter is optimized. Methods differ solely in their objectives and the data used for optimization.

Problem Formulation

We model control as a partially observable Markov decision process (POMDP). At step t, the agent receives an observation ot = (It, l), where It is the current RGB image and l is a natural-language instruction fixed within an episode. The latent state xtX is not observed directly.

The policy outputs tokenized actions utU, which the environment wrapper maps to executed robot commands atA. Episodes have fixed horizon T = 80. A trajectory is τ = (o0, u0, a0, r0, …, oT). The reward is a sparse difference-based signal: the agent is rewarded for increases in task progress, not for remaining in an already achieved state.

Notation

πθ(a|o)Policy with LoRA parameters θ; predicts action distribution given observation o.
πrefFrozen SFT reference policy (same architecture, SFT LoRA weights).
DoffOffline demonstration dataset {(oi, ai*)} used for SFT and DataBC.
BMinibatch of observations sampled during RL optimization.
β(t)Time-dependent weight of the auxiliary offline-guidance term.
ÂtAdvantage estimate at timestep t (from RL4VLA value head).
εPPO clipping parameter.

Policy Parameterization

Let φ denote the frozen OpenVLA-warmup backbone. The trainable policy is πθ(a|o) = f(φ, Δθ; o), where Δθ is a low-rank LoRA module (rank 32) attached to the policy network. For RL, we use the RL4VLA value-head modification so SFT and RL share the same backbone and action interface.

OpenVLA architecture used in our setting

OpenVLA architecture. Frozen backbone with LoRA adapter and RL4VLA value head.

RefKL and DataBC guided PPO pipelines

Guided PPO pipelines. RefKL uses a frozen SFT reference; DataBC uses offline demonstrations.

Supervised Fine-Tuning (SFT)

We first train a policy on offline demonstrations by maximizing the likelihood of expert actions. The resulting LoRA checkpoint is used either as a frozen reference πref (RefKL) or as initialization for PPO SFT-init.

(1) LSFT(θ) = - E(o,a*) ~ Doff [ log πθ(a* | o) ]
Algorithm 1: Supervised Fine-Tuning (SFT)
Input: offline dataset Doff, frozen backbone φ Output: LoRA parameters θSFT 1: Initialize LoRA adapter θ ← 0 2: Freeze backbone φ 3: while not converged do 4:   Sample minibatch B ⊂ Doff 5:   Compute LSFT(θ) on B using Eq. (1) 6:   Update θ ← θ - α ∇θ LSFT(θ) 7: end while 8: return θSFT

Proximal Policy Optimization (PPO)

PPO is our baseline online RL algorithm. At each iteration we collect on-policy rollouts, estimate advantages with the value head, and optimize the clipped surrogate objective.

(2) LPPO(θ) = Et [ min( rt(θ) Ât, clip(rt(θ), 1-ε, 1+ε) Ât ) ]
(3) rt(θ) = πθ(at|ot) / πθold(at|ot)

Here Ât is the advantage estimate and ε is the PPO clipping parameter. Standard PPO uses zero-initialized LoRA; PPO SFT-init starts from θSFT instead.

Algorithm 2: Proximal Policy Optimization (PPO)
Input: frozen backbone φ, initial LoRA θ0 (0 or θSFT) Output: RL-tuned LoRA θ 1: Initialize θ ← θ0, set θold ← θ 2: for training step t = 1, 2, … do 3:   Collect on-policy rollouts { (ot, at, rt) } in the environment 4:   Estimate advantages { Ât } with value head 5:   Compute LPPO(θ) using Eq. (2)-(3) 6:   Update θ with PPO optimizer step 7:   θold ← θ 8: end for 9: return θ

SFT-Guided PPO

For hybrid offline-online training we supplement the PPO objective with an auxiliary loss. We evaluate two variants: regularization toward a frozen SFT reference policy (RefKL) and behavior cloning on the offline dataset (DataBC). In both cases, πref is the SFT model trained on the same demonstrations as Doff.

RefKL: Reference-Policy Guidance

RefKL penalizes KL divergence between the current policy and the frozen reference on the RL minibatch B. This preserves SFT action preferences while still allowing on-policy adaptation.

(4) LRefKL(θ) = (1/|B|) ∑o ∈ B KL( πref(·|o) || πθ(·|o) )
(5) LRefKL-PPO(θ) = LPPO(θ) + β(t) · LRefKL(θ)
Algorithm 3: RefKL-Guided PPO
Input: frozen backbone φ, frozen reference πref = πθSFT, schedule β(t) Output: RL-tuned LoRA θ 1: Initialize θ ← 0, set θold ← θ 2: for training step t = 1, 2, … do 3:   Collect on-policy rollouts and estimate { Ât } 4:   Sample observation minibatch B from rollouts 5:   Compute LPPO(θ) on B using Eq. (2)-(3) 6:   Compute LRefKL(θ) on B using Eq. (4) 7:   L ← LPPO(θ) + β(t) · LRefKL(θ)  // Eq. (5) 8:   Update θ with gradient step on L 9:   θold ← θ 10: end for 11: return θ

DataBC: Offline Dataset Guidance

DataBC augments PPO with a behavior-cloning loss on offline demonstrations sampled from Doff. This directly injects expert transitions into RL optimization.

(6) LDataBC(θ) = - E(o,a*) ~ Doff [ log πθ(a* | o) ]
(7) LDataBC-PPO(θ) = LPPO(θ) + β(t) · LDataBC(θ)
Algorithm 4: DataBC-Guided PPO
Input: frozen backbone φ, offline dataset Doff, schedule β(t) Output: RL-tuned LoRA θ 1: Initialize θ ← 0, set θold ← θ 2: for training step t = 1, 2, … do 3:   Collect on-policy rollouts and estimate { Ât } 4:   Compute LPPO(θ) using Eq. (2)-(3) 5:   Sample offline minibatch Boff ⊂ Doff 6:   Compute LDataBC(θ) on Boff using Eq. (6) 7:   L ← LPPO(θ) + β(t) · LDataBC(θ)  // Eq. (7) 8:   Update θ with gradient step on L 9:   θold ← θ 10: end for 11: return θ

Regularization Weight Scheduling

The auxiliary losses are weighted by a time-dependent coefficient β(t). Rather than keeping β fixed, we use a curriculum that gradually removes offline guidance:

(8) β(t) = β0,   if t < t1
          = β0 (1 - (t - t1) / (t2 - t1)),   if t1 ≤ t < t2
          = 0,   if t ≥ t2

In our experiments, t1 = 100,000, t2 = 300,000, and β0 = 0.6. The auxiliary term is held constant for the first 100k steps, linearly annealed over the next 200k steps, and removed entirely thereafter. The same schedule is used for both RefKL and DataBC.

Ablation experiments show that stronger initial guidance improves both IND and OOD success, and that the curriculum outperforms a constant-β schedule.

Results

At an equal budget of 1M environment steps, both guided variants outperform plain PPO. RefKL reaches IND 0.93 and average OOD 0.77, matching the final 2M-step PPO checkpoint (IND 0.92, OOD 0.77).

Method Steps IND OOD Act OOD Lang OOD Vis OOD Avg
SFT0.820.460.600.740.62
PPO1M0.750.670.620.650.64
PPO SFT-init1M0.870.510.690.780.69
PPO RefKL1M0.930.790.760.760.77
PPO DataBC1M0.910.740.730.740.74
PPO2M0.920.820.750.760.77

Main benchmark results on RL4VLA. RefKL at 1M steps matches 2M-step PPO on average OOD success while using half the online interaction budget.

Comparison at Equal 1M-Step Budget

At the same online training budget, both guided variants outperform plain PPO on IND and all OOD categories. PPO initialized directly from the SFT LoRA starts from a much stronger checkpoint but improves surprisingly slowly and remains below both guided methods by 1M steps. Notably, SFT-init is relatively strong on vision and language OOD but weaker on action OOD, suggesting that fitting the supervised distribution more strongly can make execution-level adaptation under RL alone more difficult.

Beta Ablation (RefKL)

We vary the initial regularization strength β0 under the curriculum schedule and compare against a constant-β variant. Stronger auxiliary supervision consistently improves both IND and OOD success; the curriculum schedule also works better than keeping β fixed throughout training.

β IND OOD Avg
0.10.680.52
0.30.820.63
0.6 (curriculum)0.930.77
0.6 (constant)0.860.75

Training Dynamics

In-distribution training curves Out-of-distribution training curves

Training curves on RL4VLA. In-distribution and out-of-distribution success over environment steps. Dashed lines indicate final PPO performance at 2M steps. Guided variants reach higher success earlier than standard PPO; RefKL is the most consistent method.

Optimization prior: offline guidance stabilizes early RL when the on-policy signal is still weak.

RefKL vs DataBC: reference-policy KL is a smoother regularizer than fixed-dataset BC.

Curriculum on beta: strong initial guidance with decay outperforms a constant auxiliary weight.

No trade-off: faster training does not sacrifice OOD capability in this setting.

Benchmark & Evaluation

All experiments follow the RL4VLA evaluation protocol. Each checkpoint is evaluated with three evaluation seeds. We report 64 in-distribution episodes and 960 out-of-distribution episodes in total (64 episodes for each of 15 OOD environments). OOD settings are grouped into vision, language, and action shifts; reported success rates are averaged across evaluation and training seeds.

RL4VLA in-distribution and OOD scenes

RL4VLA evaluation environments. Top: an in-distribution scene used during training. Bottom: examples of out-of-distribution scenes with vision, language, and action shifts.

Analysis & Takeaways

The main empirical result is that offline-guided RL reaches the performance of a much longer PPO run while using substantially fewer online environment interactions, consistently across both IND and OOD metrics.

Complementary signals. Offline supervision and RL are not competing alternatives in this setting. SFT knowledge stabilizes and accelerates early optimization, while RL remains essential for strong final OOD behavior.

Optimization prior. During early RL, the on-policy signal is weak and exploration is inefficient. Offline guidance provides task-relevant structure before sparse reward alone becomes informative.

RefKL > DataBC. Reference-policy KL is a smoother regularizer than fixed-dataset BC and stays more consistently above standard PPO throughout training.

Initialization is not enough. Starting from SFT helps, but explicit guidance during RL is needed for the best sample-efficiency and final performance.

Among the variants considered, RefKL with strong initial guidance and curriculum decay is the most effective and consistent formulation. It improves the viability of RL fine-tuning for large-scale VLA policies by reducing expensive online interaction while preserving the main advantages of RL over offline-only training.

BibTeX

@misc{poyarkov2026offline,
  title={Leveraging Offline Supervision for Efficient and Generalizable Reinforcement Learning in Large-Scale Vision-Language-Action Models},
  author={Poyarkov, Dmitriy and Staroverov, Aleksei and Panov, Aleksandr I.},
  howpublished={ICML 2026 Workshop on Decision-Making from Offline Datasets to Online Adaptation: Black-Box Optimization to Reinforcement Learning},
  year={2026}
}