OP-GRPO: Efficient Off-Policy GRPO for Flow-Matching Models

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Zhang, Liyu, Li, Kehan, Han, Tingrui, Zhao, Tao, Sheng, Yuxuan, He, Shibo, Li, Chao
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866908939344412672
author Zhang, Liyu
Li, Kehan
Han, Tingrui
Zhao, Tao
Sheng, Yuxuan
He, Shibo
Li, Chao
author_facet Zhang, Liyu
Li, Kehan
Han, Tingrui
Zhao, Tao
Sheng, Yuxuan
He, Shibo
Li, Chao
contents Post training via GRPO has demonstrated remarkable effectiveness in improving the generation quality of flow-matching models. However, GRPO suffers from inherently low sample efficiency due to its on-policy training paradigm. To address this limitation, we present OP-GRPO, the first Off-Policy GRPO framework tailored for flow-matching models. First, we actively select high-quality trajectories and adaptively incorporate them into a replay buffer for reuse in subsequent training iterations. Second, to mitigate the distribution shift introduced by off-policy samples, we propose a sequence-level importance sampling correction that preserves the integrity of GRPO's clipping mechanism while ensuring stable policy updates. Third, we theoretically and empirically show that late denoising steps yield ill-conditioned off-policy ratios, and mitigate this by truncating trajectories at late steps. Across image and video generation benchmarks, OP-GRPO achieves comparable or superior performance to Flow-GRPO with only 34.2% of the training steps on average, yielding substantial gains in training efficiency while maintaining generation quality.
format Preprint
id arxiv_https___arxiv_org_abs_2604_04142
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle OP-GRPO: Efficient Off-Policy GRPO for Flow-Matching Models
Zhang, Liyu
Li, Kehan
Han, Tingrui
Zhao, Tao
Sheng, Yuxuan
He, Shibo
Li, Chao
Computer Vision and Pattern Recognition
Post training via GRPO has demonstrated remarkable effectiveness in improving the generation quality of flow-matching models. However, GRPO suffers from inherently low sample efficiency due to its on-policy training paradigm. To address this limitation, we present OP-GRPO, the first Off-Policy GRPO framework tailored for flow-matching models. First, we actively select high-quality trajectories and adaptively incorporate them into a replay buffer for reuse in subsequent training iterations. Second, to mitigate the distribution shift introduced by off-policy samples, we propose a sequence-level importance sampling correction that preserves the integrity of GRPO's clipping mechanism while ensuring stable policy updates. Third, we theoretically and empirically show that late denoising steps yield ill-conditioned off-policy ratios, and mitigate this by truncating trajectories at late steps. Across image and video generation benchmarks, OP-GRPO achieves comparable or superior performance to Flow-GRPO with only 34.2% of the training steps on average, yielding substantial gains in training efficiency while maintaining generation quality.
title OP-GRPO: Efficient Off-Policy GRPO for Flow-Matching Models
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2604.04142