Plug-and-Play Prompt Refinement via Latent Feedback for Diffusion Model Alignment
Suhyeon Lee, Jong Chul Ye
TL;DR
PromptLoop addresses the challenge of aligning diffusion models to user preferences without weight updates by introducing a latent-feedback RL framework in which a multimodal policy refines prompts at each denoising step. It creates a diffusion-RL–like structure by treating time-step aware prompts as actions and using intermediate latent states as feedback, while keeping the diffusion model frozen. Empirical results across multiple backbones and reward types show improved reward optimization, strong generalization to unseen models, orthogonality with existing alignment techniques, and robustness against reward hacking through prompt-based control. This plug-and-play approach offers a practical and robust path to reliable diffusion-model alignment with broad applicability.
Abstract
Despite the 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, here 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.
