让扩散模型在生成时灵活匹配多种用户偏好,无需重新训练。
Diffusion Blend: Inference-Time Multi-Preference Alignment for Diffusion Models
- 通过融合不同微调模型的反向扩散过程实现多目标对齐。
- 在不重新训练的情况下,生成效果接近甚至超越单独微调模型。
- 适合需要快速响应多样用户偏好的实际应用部署。
近期研究使用强化学习(RL)算法通过固定KL正则化下的单一奖励函数微调扩散模型,以对齐美学质量或图文一致性等下游目标。然而,这种方法在实践中存在局限:需平衡多个常冲突的目标,且用户偏好随提示词、个体和应用场景变化,对基础模型的偏离容忍度也不同。本文提出推理时多偏好对齐问题:给定一组基础奖励函数和参考KL正则化强度,能否设计一种微调方法,使在推理时可生成与任意线性组合奖励及正则化对齐的图像,而无需额外微调?我们提出Diffusion Blend,通过混合与微调模型相关的反向扩散过程解决此问题,并实现两种算法:DB-MPA用于多奖励对齐,DB-KLA用于控制KL正则化强度。大量实验表明,Diffusion Blend算法持续优于基线,生成效果接近或超过单独微调模型,实现了高效、用户驱动的推理时对齐。代码已开源:https://github.com/bluewoods127/DB-2025。
原文摘要 · Abstract (English)
Reinforcement learning (RL) algorithms have been used recently to align diffusion models with downstream objectives such as aesthetic quality and text-image consistency by fine-tuning them to maximize a single reward function under a fixed KL regularization. However, this approach is inherently restrictive in practice, where alignment must balance multiple, often conflicting objectives. Moreover, user preferences vary across prompts, individuals, and deployment contexts, with varying tolerances for deviation from a pre-trained base model. We address the problem of inference-time multi-preference alignment: given a set of basis reward functions and a reference KL regularization strength, can we design a fine-tuning procedure so that, at inference time, it can generate images aligned with any user-specified linear combination of rewards and regularization, without requiring additional fine-tuning? We propose Diffusion Blend, a novel approach to solve inference-time multi-preference alignment by blending backward diffusion processes associated with fine-tuned models, and we instantiate this approach with two algorithms: DB-MPA for multi-reward alignment and DB-KLA for KL regularization control. Extensive experiments show that Diffusion Blend algorithms consistently outperform relevant baselines and closely match or exceed the performance of individually fine-tuned models, enabling efficient, user-driven alignment at inference-time. The code is available at https://github.com/bluewoods127/DB-2025.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。