Diffusion models have become the mainstream paradigm for modern visual generation and have substantially advanced multimedia content synthesis, especially in text-to-image and text-to-video tasks. To further align such generative models with human preferences, reinforcement learning (RL) has recently shown strong potential as a post-training strategy. Nevertheless, existing policy gradient-based methods often explore inefficiently, making them vulnerable to local optima that may degrade semantic faithfulness and visual realism. To address these challenges, we present Reflection-Aware GRPO (RA-GRPO), a new RL-based preference alignment framework for diffusion generative models. The core idea is to improve "forward" generation by incorporating "backward" reflection during optimization. We first introduce Diffusion Reflection, which rectifies intermediate sampling trajectories by inverting the diffusion process with a weak estimator, guiding latent states toward higher-probability regions of the true data manifold. Furthermore, we introduce Counterfactual Path Synthesis to implicitly distill these rectified trajectories into the policy, enabling the model to internalize the benefits of search-based exploration without incurring inference-time overhead. Extensive experiments on T2I and T2V models demonstrate that RA-GRPO significantly outperforms existing methods, particularly in mitigating reward hacking and improving generalization. The method remains architecture-agnostic and integrates seamlessly with standard pipelines, suggesting a promising direction for stable preference alignment.
Figures & tables
Figure 1. Visualization of the proposed RA-GRPO framework. The figure illustrates the key components of the RA-GRPO pipeline, including Diffusion Reflection, Implicit Distillation via Counterfactual Path Synthesis, and Active Exploration. The process involves a probabilistic sampling trajectory, with steps of forward denoising, backward reflection, and counterfactual path synthesis. The system aims to generate high-quality outputs while exploring expanded solution spaces with low computational overhead. Example output: A synthetic oil painting of Cristiano Ronaldo holding a chicken from the 1980s.
Reward Model
Method
HPSv2.1 ↑
PickScore ↑
CLIPScore ↑
ImageReward ↑
HPSv3 ↑
/
Flux.1-dev
0.305
0.230
0.388
1.127
13.683
HPSv2.1
DanceGRPO
0.359
0.227
0.362
1.273
14.400
MixGRPO
0.370
0.227
0.363
1.377
14.717
Ours
0.378
0.230
0.369
1.417
15.324
PickScore
DanceGRPO
0.323
0.239
0.376
1.162
12.626
MixGRPO
0.323
0.238
0.378
1.193
12.980
Table 1. Comparison of different training methods under various reward models evaluated on multiple automatic metrics.
Figure 2. Qualitative comparison of image generation across different methods: Flux.1-dev, DanceGRPO, MixGRPO, and our method. For each prompt (A–D), the generated images highlight the varying degrees of semantic accuracy, creativity, and fidelity, with our method consistently producing better results in terms of visual quality and alignment with the text.
Metric
Baseline
w/o CF Synth.
w/o Reflection
Ours
HPSv2.1 ↑
0.359
0.366
0.357
0.378
PickScore ↑
0.227
0.226
0.229
0.230
CLIPScore ↑
0.362
0.355
0.356
0.369
ImageReward ↑
1.273
1.230
1.253
1.417
HPSv3 ↑
14.400
15.245
14.697
15.324
Table 2. Ablation study of RA-GRPO. The table compares performance across different configurations: Baseline, with and without Counterfactual Synthesis (CF Synth.), and without Reflection. Higher values indicate better performance for all metrics.
Figure 3. Qualitative comparison: The left panel shows results obtained with HPSv2.1-based optimization, while the right panel shows results obtained with PickScore-based optimization. Under HPSv2.1 training, DanceGRPO tends to introduce abnormal lighting and highlight artifacts, as illustrated in the red-boxed regions. Under PickScore training, DanceGRPO exhibits a tendency toward overly dark global tones; moreover, the zoomed-in red-boxed regions show that, despite dense high-frequency textures, object boundaries and structural contours remain blurry and poorly defined.
Metric
Reflection Ratio r
0.25
0.5
0.75
1.0
HPSv2.1
0.369
0.378
0.377
0.374
PickScore
0.229
0.230
0.232
0.230
CLIPScore
0.363
0.369
0.367
0.364
ImageReward
1.392
1.417
1.406
1.399
HPSv3
15.203
15.324
15.203
15.194
Table 3. Effect of the reflection ratio r in Randomized Single-Step Reflection. Here, r denotes the fraction of sampled trajectories selected for reflection.
Metric
Wan 2.1-1.3B
DanceGRPO
Ours
(A) Video-level setting (trained with VideoAlign-VQ)
VQ ↑
2.478
2.721
2.978
MQ ↑
0.177
0.239
0.303
TA ↑
0.153
0.235
0.297
(B) Image-level setting (first-frame only, trained with HPSv2)
HPSv2.1 ↑
0.249
0.296
0.304
Table 4. Results on Wan2.1 under video-level and image-level reward optimization. Higher is better for all metrics.
Current mainstream methods of aligning diffusion models with human preferences typically employ VLM-based reward models. However, these reward models, pre-trained for semantic alignment, struggle to capture the essential perceptual qualities-such as aesthetics, composition, and visual harmony. In this work, we argue that a model capable of high-fidelity generation must possess a profound understanding of these visual attributes. Based on this insight, we introduce the Diffusion-based Reward Model (DRM), a novel paradigm that use the pre-trained diffusion model as a powerful evaluative backbone. A key advantage of the DRM is its unique ability to assess not only the final image but also the noisy intermediate latents at any stage of the generative process. We leverage this step-wise evaluative capacity in two ways. First, we propose Step-wise GRPO, a reinforcement learning algorithm that provides dense, per-step rewards to resolve the imprecise credit assignment problem in GRPO algorithm, leading to more stable and effective alignment. Second, we introduce Step-wise Sampling, a novel inference strategy that employs the DRM as a dynamic guide to evaluate multiple generation paths at each step, steering the process towards higher-quality outcomes. Extensive experiments confirm that our approach significantly enhances the final quality of generated images. Code: https://github.com/jjaxonx/DRM.
Jaxon Zhang, Binxin Yang, Hubery Yin +2
Peking University · Work done during an internship at WeChat Vision, Tencent Inc. · WeChat Vision, Tencent Inc.
Diffusion models have achieved impressive results in generative tasks such as text-to-image synthesis, yet they often struggle to fully align outputs with nuanced user intent and maintain consistent aesthetic quality. Existing preference-based training methods such as Diffusion Direct Preference Optimization help address these issues, but obtain their supervision targets from the forward process q(xt−1∣xt,x0) derived from terminal samples, which is not directly aligned with the model's actual backward denoising transitions at each step. In this work, we introduce Direct Diffusion Score Preference Optimization (DDSPO), which defines stepwise preference supervision directly over backward denoising transitions through a contrastive policy pair, rather than relying on forward-process approximations from terminal samples. We propose two practical instantiations of the contrastive policy pair: training separate winning and losing models on preference data, and inducing a contrastive policy pair without additional training by using a pretrained reference model conditioned on an original prompt and a semantically degraded variant, requiring neither reward modeling nor manual annotations. Empirical results show that contrastive-policy-pair supervision is more effective than forward-process-based supervision across text-image alignment and aesthetic-quality tasks. Our implementation is available at: https://dohyun-as.github.io/DDSPO
Recent diffusion transformers have demonstrated strong image synthesis capabilities but remain inefficient to train due to weak alignment between generative and discriminative representations. While representation alignment frameworks such as REPA improve convergence by aligning noisy denoising features with pretrained visual encoders, their externally supervised alignment loss is static and lacks adaptivity during training and inference. Existing methods rely on fixed cosine alignment or contrastive objectives, which cannot dynamically balance representation consistency and generation quality, resulting in limited discriminative benefit and failing to optimize alignment in a task-adaptive manner. To address this, we propose VRPO, a reinforcement-based optimization strategy that replaces REPA's static alignment loss with a generative representation policy optimization objective. Instead of enforcing a fixed similarity constraint, VRPO treats representation alignment as a reward-guided process: the model receives adaptive rewards based on generation fidelity, perceptual quality, and semantic coherence between the diffusion features and pretrained visual embeddings. This formulation enables the generator to continuously refine its internal representations toward semantically meaningful directions while improving image quality. Our VRPO-driven training seamlessly integrates into diffusion transformers, introducing negligible computation cost and preserving full compatibility with SiT and DiT architectures. Extensive experiments on ImageNet-256x256 demonstrate that our VRPO-Alignment substantially enhances both convergence and fidelity, achieving up to +1.8 FID improvement and 2.3x faster training compared to REPA under identical compute budgets.