PromptLoop:基于潜变量反馈的即插即用提示词精炼框架,用于扩散模型对齐
PromptLoop: Plug-and-Play Prompt Refinement via Latent Feedback for Diffusion Model Alignment
把提示词精炼做成逐步闭环的 RL 策略:用 MLLM 读取扩散模型中间潜变量并逐步改写提示词,从而在不改权重的前提下实现奖励对齐,可直接迁移到文生图/编辑的偏好优化与少步采样场景。
原文依据 a multimodal large language model (MLLM) is trained with RL to iteratively update prompts based on intermediate latent states of diffusion models
摘要译文
由模型翻译 · 术语统一 · 请对照原文核对关键结论尽管近期取得了进展,基于强化学习(RL)的扩散模型微调往往在泛化性、可组合性以及抵御奖励黑客方面存在困难。近期研究将提示词精炼视为一种模块化替代方案,但多数采用前馈方式,即在整个采样轨迹中始终使用单一精炼后的提示词,因而未能充分利用强化学习的序列特性。为解决这一问题,我们提出 PromptLoop,一个将潜变量反馈引入逐步提示词精炼的即插即用 RL 框架。该方法不修改扩散模型权重,而是用 RL 训练一个多模态大语言模型(MLLM),使其依据扩散模型的中间潜变量状态迭代更新提示词。这一设计在结构上类比于扩散 RL 方法,同时保留了基于提示词的对齐方式的灵活性与通用性。在多种奖励函数与扩散骨干网络上的大量实验表明,PromptLoop(i)实现了有效的奖励优化,(ii)可无缝泛化到未见过的模型,(iii)能与现有对齐方法正交组合,(iv)在仅引入实际可忽略的推理开销的同时,缓解了过度优化与奖励黑客问题。
英文原文摘要 1316 字符
Despite recent progress, reinforcement learning (RL)-based fine-tuning of diffusion models often struggles with generalization, composability, and robustness against reward hacking. Recent studies have explored prompt refinement as a modular alternative, but most adopt a feed-forward approach that applies a single refined prompt throughout the entire sampling trajectory, thereby failing to fully leverage the sequential nature of reinforcement learning. To address this, we introduce PromptLoop, a plug-and-play RL framework that incorporates latent feedback into step-wise prompt refinement. Rather than modifying diffusion model weights, a multimodal large language model (MLLM) is trained with RL to iteratively update prompts based on intermediate latent states of diffusion models. This design achieves a structural analogy to the Diffusion RL approach, while retaining the flexibility and generality of prompt-based alignment. Extensive experiments across diverse reward functions and diffusion backbones demonstrate that PromptLoop (i) achieves effective reward optimization, (ii) generalizes seamlessly to unseen models, (iii) composes orthogonally with existing alignment methods, and (iv) mitigates over-optimization and reward hacking while introducing only a practically negligible inference overhead.