AIarXiv

Heuristic editor, no API keyVerdict: Routine

DiffusionART: Efficient, Stable and Scalable Reinforcement of Diffusion Models

Online reinforcement learning (RL) fine-tunes diffusion models with black-box rewards, but reverse-process methods such as Flow-GRPO are limited in efficiency by poor credit assignment, while forward-process methods…

By Wan, Chen, Zhang +6

Score█████░░░░░5.3

Key numbers

  • 11.72 times fewer GPU hours
  • 28.8% and 53.0% higher mean

Caveats

  • Preprint; not yet peer reviewed.

VerdictCompetent work. Briefs at most.

Read the originalPDFCode

Abstract

Online reinforcement learning (RL) fine-tunes diffusion models with black-box rewards, but reverse-process methods such as Flow-GRPO are limited in efficiency by poor credit assignment, while forward-process methods such as DiffusionNFT are efficient yet unstable without carefully tuned exponential-moving-average (EMA) off-policy training. We show that NFT-style objectives contain a hidden forward--reverse consistency force that joint positive--negative training cancels only partially, and that EMA stabilizes training through restoration rather than off-policy rollouts. We introduce DiffusionART (Diffusion Reinforcement with Aggregation-First Reward Tilting), which aggregates each prompt's rewards into a shared reward-improving direction for reverse-process states, removing the consistency force by construction, and adds a trust-region-masked second update for drift-adaptive restoration without EMA tuning. It requires no differentiable reward model, remains effective with fewer samples per prompt, and supports pairwise reward models (DiffusionART-Pairwise). Across image and video generation, DiffusionART trains efficiently and stably without per-task tuning. In particular, on HunyuanVideo-13B with equally weighted visual and motion quality rewards, DiffusionART reaches the late-stage mean reward levels of DiffusionNFT and Flow-GRPO-Fast with 12.02 and 11.72 times fewer GPU hours, respectively, while achieving 28.8% and 53.0% higher mean training rewards.

Zhenglin Wan, Jiayu Chen, Zhengfeiyang Zhang, Pengfei Zhou, Wangbo Zhao, Fangyuan Kong, Pengfei Wan, Kun Gai, Yang You

The editor's rubric

Heuristic review

DimensionLevelWeightWhat that level means
Leverage███░░ 324%A method or resource many groups across the field will adopt within a year.
Magnitude███░░ 318%Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
Evidence██░░░ 214%Limited: single setting, weak baselines, or an observational association presented as causal.
Novelty███░░ 316%A genuinely new approach to an open problem.
Trajectory███░░ 318%A clear path to scale.
Stakes██░░░ 210%Benefits a professional community (practitioners, clinicians, engineers).

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: method (we propose, we report); gains (x-fold); novelty (alternative to status quo); verification (code released); scale (scalable, efficient).

How the score was computed

rank-2026-10-07

Score█████░░░░░5.3

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Merit
4.5 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.2 / 10
Shrunk toward the desk prior by editor confidence (42%).
Attention
90%
Citations, upvotes, points, mentions.
Freshness
35%
Half-life decay since publication.
  • Citations0 (reference 15, via semantic-scholar, Oct 12, 2026, 13:49 UTC)
  • Influential citations0 (reference 3, via semantic-scholar, Oct 12, 2026, 13:49 UTC)
  • Hugging Face upvotes153 (reference 25, via hf-daily, Oct 12, 2026, 13:49 UTC)
  • GitHub stars6 (reference 250, via hf-daily, Oct 12, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v6 on Oct 12, 2026, 01:23 UTC. Paper type: method.
  • Categories: cs.LG
  • TOP, No.4 in the Artificial Intelligence edition of October 12, 2026.