CORTEXA
← Browse
arxivcs.LGcs.AI2026-07-07

D2PO: Optimizing Diffusion Samplers via Dynamic Preference

Jinkyu Kim, Jinyoung Choi, Bohyung Han

We propose D2PO (Dynamic Direct Preference Optimization), a principled framework for optimizing diffusion sampling policies with respect to timestep schedules and classifier-free guidance (CFG) weights. Our work is motivated by a fundamental limitation of existing student-teacher regression frameworks; low-NFE student samplers are trained to mimic high-NFEteachers, often sacrificing high-frequency texture fidelity while preserving coarse global structures, thereby misaligning the sampler with perceptual quality. D2PO addresses this challenge by reformulating sampler optimization as a preference-based alignment problem, leveraging the Direct Preference Optimization (DPO) framework. To make DPO applicable to diffusion samplers, we model the sampling policy as an energy-based model (EBM), transforming preference comparisons into tractable energy differences. We further introduce a novel energy formulation derived directly from the pretrained score network, enabling preference evaluation in perturbed spaces that jointly capture structural consistency and fine-grained details. Moreover, we introduce dynamic preferences, where the preferred samples used for alignment progressively improve as the sampling policies are learned. This self-improving mechanism replaces rigid static teacher supervision with an iterative, preference-guided refinement process, providing progressively stronger alignment signals. Extensive experiments demonstrate that D2PO aligns diffusion samplers with perceptual quality more faithfully, unlocking the full potential of high-quality teachers and consistently outperforming conventional regression-based schedulers under low-NFE constraints.

View free PDFSource page

Related papers

arxivcs.CVcs.AIcs.LG2026-07-04

Self-Improving Diffusion Classifiers with Minority Preference Optimization

Hyunsoo Kim, Jungmyung Wi, Soobin Um, Donghyun Kim, Suhyun Kim

Prior studies have demonstrated that diffusion classifiers achieve robust zero-shot classification performance. However, their effectiveness is strongly tied to the pretraining data distribution: they perform well in majority, high-density regions of the data manifold, but are si…

View free PDFSource page
arxivstat.MLcs.AIcs.LGmath.OC2026-06-29

Optimization Dynamics Imprint Semantic Specificity in Contrastive Embedding Norms

Ziwei Su, Junyu Ren, Victor Veitch

Contrastive embedding models trained with scale-invariant losses are typically paired with distance metrics like cosine similarity, effectively ignoring embedding magnitudes. However, surprisingly, empirical studies reveal that despite this, these "discarded" norms seem to correl…

View free PDFSource page
arxivcs.LGcs.AI2026-06-26

Normalized Rewards for Preference Optimization

Shawn Im, Federico Danieli, Skyler Seto, Barry-John Theobald, Katherine Metcalf

Direct Alignment Algorithms (DAAs) such as DPO have become a common way to post-train and align LLMs with human preferences. However, DAAs have been observed to over-optimize their implicit reward model and decrease the likelihood of preferred responses. This results in a decreas…

View free PDFSource page
arxivcs.CVcs.AIcs.LG2026-07-04

Unified Backbone Refinement for Diffusion Models via Internal-Latent Analysis

Haksoo Lim, Myeongjin Lee, Wonjoon Chang, Jaesik Choi

Diffusion models have achieved remarkable success across diverse domains, with performance closely related to the denoising backbones that parameterize the score function. In this paper, we present a systematic, phase-aware analysis of diffusion components and show that abrupt, e…

View free PDFSource page
arxivcs.LGcs.AIstat.ML2026-07-21

Provable diffusion-based posterior sampling for linear inverse problems via DDIM

Yuchen Jiao, Na Li, Changxiao Cai, Yuxin Chen, Gen Li

Diffusion-based methods have achieved remarkable empirical success in solving inverse problems. However, many existing posterior samplers either lack rigorous theoretical guarantees or incur substantial computational overhead. We propose a simple and efficient algorithm, called \…

View free PDFSource page