通过相关性加权优化,让图像模型更好同时满足多概念提示。
Correlation-Weighted Multi-Reward Optimization for Compositional Generation
- 按概念分组并用相关性动态调整奖励权重
- 在多个基准上显著提升多概念生成一致性
- 适合需要精准控制复杂场景的生成任务
文本到图像模型虽能较好对齐自然语言提示,但组合生成仍面临核心挑战。模型常无法同时满足单个提示中的多个概念,导致部分概念缺失,表现为生成失败。这反映出在奖励优化中联合优化多个概念的困难,因竞争性概念会相互干扰。为此,我们提出相关性加权多奖励优化(CMO)框架,利用概念奖励间的相关结构,自适应调整各属性概念的优化权重。通过考虑概念间交互,CMO平衡冲突的奖励信号,并突出那些部分满足但生成不一致的概念,从而提升组合生成效果。具体地,将多概念提示分解为预定义概念组(如对象、属性、关系),从专用奖励模型获取各概念的奖励信号,再基于相关性估计难度,自适应重加权,赋予冲突或难满足概念更高权重。聚焦每组中最困难的概念进行优化,使模型能一致地同时满足所有请求属性。我们在SD3.5和FLUX.1-dev等主流扩散模型上应用该方法,在ConceptMix、GenEval 2和T2I-CompBench等挑战性多概念基准上均实现稳定提升。代码已开源:https://github.com/TheDarkKnight-21th/CMO。
原文摘要 · Abstract (English)
Text-to-image models produce images that align well with natural language prompts, but compositional generation has long been a central challenge. Models often struggle to satisfy multiple concepts within a single prompt, frequently omitting some concepts and resulting in partial success. Such failures highlight the difficulty of jointly optimizing multiple concepts during reward optimization, where competing concepts can interfere with one another. To address this limitation, we propose Correlation-Weighted Multi-Reward Optimization (CMO), a framework that leverages the correlation structure among concept rewards to adaptively weight each attribute concept in optimization. By accounting for interactions among concepts, CMO balances competing reward signals and emphasizes concepts that are partially satisfied yet inconsistently generated across samples, improving compositional generation. Specifically, we decompose multi-concept prompts into pre-defined concept groups (e.g., objects, attributes, and relations) and obtain reward signals from dedicated reward models for each concept. We then adaptively reweight these rewards, assigning higher weights to conflicting or hard-to-satisfy concepts using correlation-based difficulty estimation. By focusing optimization on the most challenging concepts within each group, CMO encourages the model to consistently satisfy all requested attributes simultaneously. We apply our approach to train state-of-the-art diffusion models, SD3.5 and FLUX.1-dev, and demonstrate consistent improvements on challenging multi-concept benchmarks, including ConceptMix, GenEval 2, and T2I-CompBench. The code is available at https://github.com/TheDarkKnight-21th/CMO.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。