RewardDance:视觉生成中的奖励缩放

RewardDance: Reward Scaling in Visual Generation

高宇 Yu Gao · ByteDance Seed · 2025-09-10 · arXiv:2509.08826 ↗ · 被引 54

打开互动全文版(逐段中英对照 + 图/公式 + 论文问答)→

摘要 · Abstract

奖励模型对于通过强化学习改进生成模型至关重要,然而视觉生成中的奖励模型缩放范式仍未被充分探索。这主要源于现有方法的基本限制:基于 CLIP 的奖励模型受限于架构和输入模态,而广泛使用的 Bradley-Terry 损失与视觉语言模型的下一个标记预测机制根本不对齐,阻碍了有效缩放。更关键的是,RLHF 优化过程受到奖励破解问题的困扰,模型利用奖励信号的缺陷而不提升真实质量。为了解决这些挑战,我们引入了 RewardDance,一个可扩展的奖励建模框架,通过一种新颖的生成式奖励范式克服了这些障碍。通过将奖励分数重新定义为模型预测“是”标记的概率(表示生成的图像根据特定标准优于参考图像),RewardDance 内在地将奖励目标与视觉语言模型架构对齐。这种对齐解锁了两个维度的缩放:(1)模型缩放:系统地将奖励模型扩展到 260 亿参数;(2)上下文缩放:集成任务特定指令、参考示例和思维链推理。大量实验表明,RewardDance 在文本到图像、文本到视频和图像到视频生成中显著超越了最先进的方法。关键的是,我们解决了“奖励破解”这一持续挑战:我们的大规模奖励模型在强化学习微调期间表现出并保持高奖励方差,证明了其抵抗破解的能力以及产生多样化、高质量输出的能力。这极大地缓解了困扰较小模型的模式崩溃问题。

Reward Models (RMs) are critical for improving generation models via Reinforcement Learning (RL), yet the RM scaling paradigm in visual generation remains largely unexplored. It primarily due to fundamental limitations in existing approaches: CLIP-based RMs suffer from architectural and input modality constraints, while prevalent Bradley-Terry losses are fundamentally misaligned with the next-token prediction mechanism of Vision-Language Models (VLMs), hindering effective scaling. More critically, the RLHF optimization process is plagued by Reward Hacking issue, where models exploit flaws in the reward signal without improving true quality. To address these challenges, we introduce RewardDance, a scalable reward modeling framework that overcomes these barriers through a novel generative reward paradigm. By reformulating the reward score as the model's probability of predicting a "yes" token, indicating that the generated image outperforms a reference image according to specific criteria, RewardDance intrinsically aligns reward objectives with VLM architectures. This alignment unlocks scaling across two dimensions: (1) Model Scaling: Systematic scaling of RMs up to 26 billion parameters; (2) Context Scaling: Integration of task-specific instructions, reference examples, and chain-of-thought (CoT) reasoning. Extensive experiments demonstrate that RewardDance significantly surpasses state-of-the-art methods in text-to-image, text-to-video, and image-to-video generation. Crucially, we resolve the persistent challenge of "reward hacking": Our large-scale RMs exhibit and maintain high reward variance during RL fine-tuning, proving their resistance to hacking and ability to produce diverse, high-quality outputs. It greatly relieves the mode collapse problem that plagues smaller models.

核心贡献 · Key contributions

局限 · Limitations

论文章节 · Sections(共 17)

阅读逐段中英对照全文 →