LGCVApr 25

V-GRPO: Online Reinforcement Learning for Denoising Generative Models Is Easier than You Think

arXiv:2604.2338037.91 citations
Predicted impact top 7% in LG · last 90 daysOriginality Incremental advance
AI Analysis

For practitioners of generative AI, V-GRPO provides a simpler and more efficient online RL alignment method that outperforms prior approaches.

V-GRPO introduces an online RL method for aligning denoising generative models with human preferences, achieving state-of-the-art text-to-image synthesis with 2× speedup over MixGRPO and 3× speedup over DiffusionNFT.

Aligning denoising generative models with human preferences or verifiable rewards remains a key challenge. While policy-gradient online reinforcement learning (RL) offers a principled post-training framework, its direct application is hindered by the intractable likelihoods of these models. Prior work therefore either optimizes an induced Markov decision process (MDP) over sampling trajectories, which is stable but inefficient, or uses likelihood surrogates based on the diffusion evidence lower bound (ELBO), which have so far underperformed on visual generation. Our key insight is that the ELBO-based approach can, in fact, be made both stable and efficient. By reducing surrogate variance and controlling gradient steps, we show that this approach can beat MDP-based methods. To this end, we introduce Variational GRPO (V-GRPO), a method that integrates ELBO-based surrogates with the Group Relative Policy Optimization (GRPO) algorithm, alongside a set of simple yet essential techniques. Our method is easy to implement, aligns with pretraining objectives, and avoids the limitations of MDP-based methods. V-GRPO achieves state-of-the-art performance in text-to-image synthesis, while delivering a $2\times$ speedup over MixGRPO and a $3\times$ speedup over DiffusionNFT.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes