Rethinking Direct Preference Optimization in Diffusion Models

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Kang, Junyong, Lim, Seohyun, Baek, Kyungjune, Shim, Hyunjung
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866918262385672192
author Kang, Junyong
Lim, Seohyun
Baek, Kyungjune
Shim, Hyunjung
author_facet Kang, Junyong
Lim, Seohyun
Baek, Kyungjune
Shim, Hyunjung
contents Aligning text-to-image (T2I) diffusion models with human preferences has emerged as a critical research challenge. While recent advances in this area have extended preference optimization techniques from large language models (LLMs) to the diffusion setting, they often struggle with limited exploration. In this work, we propose a novel and orthogonal approach to enhancing diffusion-based preference optimization. First, we introduce a stable reference model update strategy that relaxes the frozen reference model, encouraging exploration while maintaining a stable optimization anchor through reference model regularization. Second, we present a timestep-aware training strategy that mitigates the reward scale imbalance problem across timesteps. Our method can be integrated into various preference optimization algorithms. Experimental results show that our approach improves the performance of state-of-the-art methods on human preference evaluation benchmarks. The code is available at the Github: https://github.com/kaist-cvml/RethinkingDPO_Diffusion_Models.
format Preprint
id arxiv_https___arxiv_org_abs_2505_18736
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Rethinking Direct Preference Optimization in Diffusion Models
Kang, Junyong
Lim, Seohyun
Baek, Kyungjune
Shim, Hyunjung
Computer Vision and Pattern Recognition
Aligning text-to-image (T2I) diffusion models with human preferences has emerged as a critical research challenge. While recent advances in this area have extended preference optimization techniques from large language models (LLMs) to the diffusion setting, they often struggle with limited exploration. In this work, we propose a novel and orthogonal approach to enhancing diffusion-based preference optimization. First, we introduce a stable reference model update strategy that relaxes the frozen reference model, encouraging exploration while maintaining a stable optimization anchor through reference model regularization. Second, we present a timestep-aware training strategy that mitigates the reward scale imbalance problem across timesteps. Our method can be integrated into various preference optimization algorithms. Experimental results show that our approach improves the performance of state-of-the-art methods on human preference evaluation benchmarks. The code is available at the Github: https://github.com/kaist-cvml/RethinkingDPO_Diffusion_Models.
title Rethinking Direct Preference Optimization in Diffusion Models
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2505.18736