Skip to content

Prism-GRPO: Faster VLA Policy Optimization via Splitting Same-outcome Groups

Aug 2026 · 0 citations · 39 references
Computer Science

TL;DR

Across four RoboTwin tasks spanning different horizons and coordination patterns, Prism-GRPO improves success and quality at matched rollout budgets and reaches target success rates with up to 56% fewer rollouts.

Abstract

GRPO is increasingly used for reinforcement learning of vision-language-action (VLA) policies because, unlike PPO, it does not require training a critic. This simplification comes with a sampling cost: group-relative advantages require multiple rollouts from each scene. Under binary success rewards, groups whose rollouts all succeed or all fail have zero advantage and are discarded by dynamic sampling. These groups are especially common early in training, when most rollouts fail, wasting much of the expensive robotic rollout budget. We introduce Prism-GRPO, which augments binary outcome reward with a weighted trajectory-level execution-quality score. By splitting same-outcome groups into a quality spectrum, Prism-GRPO recovers training signal while ensuring that every success still outranks every failure. Quality scores can be derived from simulator contacts, executed actions, or visual observations, avoiding task-specific progress rewards. We prove that Prism-GRPO never increases the probability that a sampled group is discarded for having zero advantages, and derive a gradient-alignment condition under which its combined update remains a local ascent direction for task success. Across four RoboTwin tasks spanning different horizons and coordination patterns, Prism-GRPO improves success and quality at matched rollout budgets and reaches target success rates with up to 56% fewer rollouts. It also suppresses a reward-hacking shortcut, with the cleaner behavior transferring under direct deployment to a real robot. Through ablations, we show consistent gains across contact-, smoothness-, and VLM-derived quality signals.

View source

Similar papers

Preprint Aug 2026

Temporal GRPO: Beyond Trajectory-Level Credit in Vision-Language-Action Reinforcement Learning

Temporal GRPO addresses the problem of trajectory-level credit aliasing in post-train VLA policies by constructing detectable task stages, aligning each rollout with stage-specific action intervals, and comparing only rollouts that have entered the same stage.

Yao Zhou, Hang Gao, Fengge Wu et al. · 0 citations
Jun 2026

Z-1: Efficient Reinforcement Learning for Vision-Language-Action Models

The results show that systematic GRPO post-training can substantially improve flow-based VLA policies without additional private demonstrations, and outperforms the published sota models.

Lang Cao, Renhong Chen, Luyi Li et al. · 0 citations
Preprint Jul 2026

SIEVE: Structure-Aware Data Selection for Imitation Learning with VLA Models

SIEVE, a structure-aware data selection method for VLA imitation learning that can surpass full-data training while using only 50% of demonstrations and 50% of training steps, suggests that reusable structure, captured through primitives and transitions, is an important signal for efficient VLA imitation learning.

Changti Wu, Bin Yu, Zhaolong Shen et al. · 0 citations
Preprint Aug 2026

Robo-Dopamine 2.0: History-Conditioned and OOD-Aware Process Reward Modeling for Robotic Manipulation

This work introduces Robo-Dopamine 2.0, a history- and OOD-aware process reward model with a pairwise prediction interface that combines history-conditioned pairwise rewards that use source-aligned reference panels for synthetic OOD queries and observed rollout history for online queries, while preserving the queried endpoints.

Yijie Xu, Haopeng Jin, Run Zhou et al. · 0 citations
Preprint Jul 2026

Foresight Residual RL for Long-Horizon Robot Manipulation with Vision-Language-Action Models

Foresight Residual RL is proposed, which optimizes handoff quality by augmenting each subtask's sparse success reward with an offline-estimated foresight value -- the probability of future subtask success conditioned on the terminal state of the current subtask.

Yuhan Liu, Xinyu Zhang, Litao Liu et al. · 1 citation

Related blog posts

MIT News · Artificial Intelligence Aug 27, 2026

Looking beyond natural sequences

A new machine-learning framework aims to improve the success rate of computational protein design while moving away from results that reproduce sequences found in nature.