AI & ML
Designing Reinforcement Learning for Diffusion Models: A Unified Path-Space View
arXiv stat.ML0 views
arXiv:2608.14430v3 Announce Type: replace-cross Abstract: Reinforcement learning (RL) post-training provides a direct way to align diffusion models with human preferences and task-specific rewards. However, current RL algorithms for diffusion models remain fragmented: reverse-trajectory methods rely on discretized likelihood ratios, whereas forward-matching methods train on reward-labeled noising versions of the rollout samples. This paper shows that these seemingly different losses arise from a single path-space principle. Starting from the regularized diffusion-RL objective, we use importance sampling between sampling SDEs to obtain an explicit policy-gradient estimator on trajectory space. The estimator contains the stochastic It\^o integral underlying Flow-GRPO-type updates; we derive an equivalent variance-reduced value-gradient form that recovers the forward-matching structure of AWM and DiffusionNFT. This identifies the empirical gap between these method families as a variance-reduction effect rather than a difference in RL principle. The derivation yields a unified design space organized by value-gradient estimation, weight functions, and sampling choices. Within this space, we propose a multi-sample KDE value-gradient estimator that reuses rollout groups, together with scale-bounded weight families that retain stable existing recipes while excluding singular ones. Experiments on SD3.5-M and Qwen-Image models validate the variance-reduction explanation and show that the resulting recipe improves over prior diffusion-RL baselines.
Source:https://arxiv.org/abs/2608.14430PreviousQuerying Counterfactuals on Tissue Graphs with Supervised DisentanglementNextGeometry-Constrained Kolmogorov-Arnold Networks: Learning Edge Geometry via Banach Duality
Related posts
Are LLM Safety Judges Policy-Invariant? A Three-Principle Stress-Test
0arXiv cs.SE
Vibe Coding in Software Development: A Multivocal Literature Review
0arXiv cs.SE
Large Language Models for Multi-Lingual Equivalent Mutant Detection: An Extended Empirical Study
0arXiv cs.SE
Characterizing Robustness in Semantic Code Clone Detection
0arXiv cs.SE
AI Slop and the Software Commons
0arXiv cs.SE
Detecting Silent Faults at the Environment-Trainer Boundary in Reinforcement Learning
0arXiv cs.SE