提出MIRA方法,在不微调模型的情况下,让文本生成图像更贴合用户评分且不跑偏。
MIRA: Towards Mitigating Reward Hacking in Inference-Time Alignment of T2I Diffusion Models
- 通过图像空间的分数引导约束采样轨迹,防止奖励欺骗
- 在SDv1.5和SDXL上对齐多种评分指标,胜率超60%且提示保持度高
- 适用于无法微调的场景,尤其适合非可微奖励的偏好优化
扩散模型虽能根据文本生成图像,但生成结果常无法满足用户定义的标量奖励(如审美分)。传统对齐需微调,计算成本高。近期推理时通过噪声优化实现高效对齐,但存在奖励欺骗问题——生成高分图像却严重偏离原提示。本文指出仅靠噪声空间正则化不足,必须引入显式的图像空间约束。为此提出MIRA(Mitigating Reward Hacking),一种无需训练的推理时对齐方法。MIRA采用冻结主干网络的基于得分的KL代理,约束采样路径,使奖励提升的同时避免分布漂移(即奖励欺骗)。推导出利用扩散得分的可计算近似。在SDv1.5与SDXL上,针对多种奖励(美学、HPSv2、PickScore)及数据集(如Animal-Animal、HPDv2),MIRA相较强基线胜率超60%,且提示遵循性良好;机制图显示奖励提升伴随几乎零漂移,而传统方法随算力增加漂移加剧。进一步提出MIRA-DPO,将偏好优化映射至推理时,无需微调即可处理不可微奖励。
原文摘要 · Abstract (English)
Diffusion models excel at generating images conditioned on text prompts, but the resulting images often do not satisfy user-specific criteria measured by scalar rewards such as Aesthetic Scores. This alignment typically requires fine-tuning, which is computationally demanding. Recently, inference-time alignment via noise optimization has emerged as an efficient alternative, modifying initial input noise to steer the diffusion denoising process towards generating high-reward images. However, this approach suffers from reward hacking, where the model produces images that score highly, yet deviate significantly from the original prompt. We show that noise-space regularization is insufficient and that preventing reward hacking requires an explicit image-space constraint. To this end, we propose MIRA (MItigating Reward hAcking), a training-free, inference-time alignment method. MIRA introduces an image-space, score-based KL surrogate that regularizes the sampling trajectory with a frozen backbone, constraining the output distribution so reward can increase without off-distribution drift (reward hacking). We derive a tractable approximation to KL using diffusion scores. Across SDv1.5 and SDXL, multiple rewards (Aesthetic, HPSv2, PickScore), and public datasets (e.g., Animal-Animal, HPDv2), MIRA achieves >60\% win rate vs. strong baselines while preserving prompt adherence; mechanism plots show reward gains with near-zero drift, whereas DNO drifts as compute increases. We further introduce MIRA-DPO, mapping preference optimization to inference time with a frozen backbone, extending MIRA to non-differentiable rewards without fine-tuning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。