arXiv Computer Vision

Learning to Credit the Right Steps: Objective-aware Process Optimization for Visual Generation

The paper introduces Objective-aware Trajectory Credit Assignment (OTCA), a framework that refines reinforcement learning for diffusion-based visual generation. OTCA decomposes credit across denoising steps and allocates multiple reward signals adaptively, addressing the coarse, uniform reward assignment of existing GRPO pipelines. Experiments demonstrate that OTCA consistently enhances image and video generation quality across various metrics.

arXiv Computer Vision
Sep 7

Step Back to Move Forward: Reflection-Aware Preference Optimization for Visual Generation

The paper introduces Reflection-Aware GRPO (RA‑GRPO), a reinforcement‑learning framework that aligns diffusion generative models with human preferences. It uses Diffusion Reflection to correct intermediate sampling paths by reversing the diffusion process, and Counterfactual Path Synthesis to embed these corrected trajectories into the policy, avoiding extra inference cost. Experiments on text‑to‑image and text‑to‑video models show RA‑GRPO outperforms existing methods, reducing reward hacking and improving generalization while remaining architecture‑agnostic.

By Junlong Wu, Jiuzhou Lin, Jia Sun, Boheng Zhang, Huaiqing Wang, Dewen Fan, Houde Liu, Qianqian Gan, Fan Yang, Tingting Gao
arXiv Computer Vision
Sep 30

Think Before You Score: Thinking Reward Model for Visual Generation

arXiv:2609.37372v1 Announce Type: new Abstract: Visual reward models are essential for evaluating and improving visual generation models, yet existing approaches typically map task conditions and can...

By Xuehai Bai, Zhenchen Tang, Yang Shi, Dianyi Wang, Tengfei Liu, Wanshun Su, Xuanyu Zhu, Ruohui Wang, Haiwen Diao, Haotian Wang, Xiaoling Gu, Yuanxing Zhang
arXiv AI
Jul 1

Finite Difference Flow Optimization for RL Post-Training of Text-to-Image Models

arXiv:2603. 12893v2 Announce Type: replace-cross Abstract: Reinforcement learning (RL) has become a standard technique for post-training diffusion-based image synthesis models, as it enables learning from reward signals to explicitly improve desirable aspects such as image quality and prompt alignment.

By David McAllister, Miika Aittala, Tero Karras, Janne Hellsten, Angjoo Kanazawa, Timo Aila, Samuli Laine
arXiv Machine Learning
Jul 3

Optimizing Visual Generative Models via Distribution-wise Rewards

arXiv:2607. 02291v1 Announce Type: new Abstract: Conventional reinforcement learning strategies for visual generation typically employ sample-wise reward functions, yet this practice frequently results in reward hacking that degrades image diversity and introduces visual anomalies.

By Ruihang Li, Mengde Xu, Shuyang Gu, Leigang Qu, Fuli Feng, Han Hu, Wenjie Wang
Hugging Face Trending Papers
Oct 15

Routing Policy Optimization for Online Diffusion Reinforcement Learning

Routing Policy Optimization (RPO) introduces stochastic exploration within a diffusion visual generator by treating attention routing as a stochastic action. Instead of perturbing the entire reverse denoising trajectory, RPO samples key attention blocks at selected denoising levels, perturbs the transition velocity, and evaluates the perturbation with a score‑function objective. A two‑rollout estimator provides an advantage signal, and after training the model restores dense attention, yielding higher generation quality and nearly four times the training efficiency compared to Flow‑GRPO‑style methods.

arXiv Computer Vision
Oct 16

Routing Policy Optimization for Online Diffusion Reinforcement Learning

Routing Policy Optimization (RPO) introduces stochastic exploration directly within a visual generator’s attention mechanism, avoiding costly rollout-based optimization. By sampling key attention blocks at selected denoising levels and perturbing the transition velocity, RPO uses a Gaussian likelihood and a two‑rollout estimator to provide an advantage signal for learning. Experiments on text‑to‑image and text‑to‑video tasks demonstrate improved generation quality and nearly four times higher training efficiency compared to Flow‑GRPO‑style methods.

By Qiuhong Shen, Yiding Yang, Yuxin Zhang, Xinwei Huang, Minxuan Lin, Bo Liu, Hao Kang, Haotian Yang, Yizhi Wang, Chongyang Ma, Xinchao Wang
arXiv AI
Jun 24

FlowR2A: Learning Reward-to-Action Distribution for Multimodal Driving Planning

arXiv:2606. 24231v1 Announce Type: new Abstract: Multimodal driving planning faces a long-standing tension between two paradigms: scoring-based methods benefit from dense reward supervision but are confined to a fixed action vocabulary, while anchor-based methods generate proposals dynamically yet suffer from sparse supervision constrained to a single ground-truth trajectory.

By Xirui Li, Zhe Liu, Xiaoqing Ye, Wenhua Han, Yifeng Pan, Junyu Han, Hengshuang Zhao
arXiv Machine Learning
Oct 12

DiffusionART: Efficient, Stable and Scalable Reinforcement of Diffusion Models

DiffusionART introduces a new reinforcement learning framework for diffusion models that aggregates prompt rewards into a shared direction, eliminating consistency forces inherent in prior methods. It employs a trust‑region‑masked second update for drift‑adaptive restoration, removing the need for EMA tuning and differentiable reward models. Experiments on image and video generation show that DiffusionART trains more efficiently and stably, achieving higher mean rewards with significantly fewer GPU hours compared to existing approaches.

By Zhenglin Wan, Jiayu Chen, Zhengfeiyang Zhang, Pengfei Zhou, Wangbo Zhao, Fangyuan Kong, Pengfei Wan, Kun Gai, Yang You
arXiv Computer Vision
Sep 25

AdaPilot: Towards Scene-Adaptive Policy Learning for Cross-Generator Text-to-Image Quality Optimization

AdaPilot introduces a scene-adaptive, cross-generator policy for optimizing text-to-image generation quality. By framing multi-turn image generation as a Markov Decision Process and using reinforcement learning, it decouples the policy from specific generator internals, incorporates scene-aware and process-level rewards, and achieves superior quality and generalization compared to baselines. Experiments demonstrate that a single AdaPilot policy can transfer zero‑shot to unseen generators while consistently improving performance across all evaluated models.

By Wenjin Liu, Fayuan Ke, Yue Lu, Zhe Cui, Anh Tuan Luu, Haoran Luo