Co-GRPO: Co-Optimized Group Relative Policy Optimization for Masked Diffusion Model
Renping Zhou, Zanlin Ni, Tianyi Chen, Zeyu Liu, Yang Yue, Yulin Wang, Yuxuan Wang, Jingshu Liu, Gao Huang
TL;DR
This work tackles the mismatch between single-step BERT-style training and trajectory-driven inference in Masked Diffusion Models (MDMs) by formulating generation as a unified Markov Decision Process and applying trajectory-level Group Relative Policy Optimization to jointly optimize both the denoising model and the inference schedule. The proposed Co-GRPO framework introduces a trainable scheduling policy that co-adapts with the model, employing an alternating optimization strategy to stabilize training and avoid backpropagation through multi-step generation. Empirical results on ImageReward, HPSv2, GenEval, and DPG-Bench show substantial gains over Naive GRPO and baselines, including zero-shot improvements on unseen benchmarks, demonstrating strong generalization. The approach offers a practical path to align training and inference in MDMs, enabling higher-quality, more faithful text-to-image generation with learnable schedules and improved efficiency at inference time.
Abstract
Recently, Masked Diffusion Models (MDMs) have shown promising potential across vision, language, and cross-modal generation. However, a notable discrepancy exists between their training and inference procedures. In particular, MDM inference is a multi-step, iterative process governed not only by the model itself but also by various schedules that dictate the token-decoding trajectory (e.g., how many tokens to decode at each step). In contrast, MDMs are typically trained using a simplified, single-step BERT-style objective that masks a subset of tokens and predicts all of them simultaneously. This step-level simplification fundamentally disconnects the training paradigm from the trajectory-level nature of inference, leaving the inference schedules never optimized during training. In this paper, we introduce Co-GRPO, which reformulates MDM generation as a unified Markov Decision Process (MDP) that jointly incorporates both the model and the inference schedule. By applying Group Relative Policy Optimization at the trajectory level, Co-GRPO cooperatively optimizes model parameters and schedule parameters under a shared reward, without requiring costly backpropagation through the multi-step generation process. This holistic optimization aligns training with inference more thoroughly and substantially improves generation quality. Empirical results across four benchmarks-ImageReward, HPS, GenEval, and DPG-Bench-demonstrate the effectiveness of our approach. For more details, please refer to our project page: https://co-grpo.github.io/ .
