FestDPO: Few-step Generator Alignment with Direct Preference Optimization
cs.LG
Submitted: 2026-09-28
Updated: 2026-09-28
Comments: Preprint. Under Review
Code: https://github.com/dongyeop3813/Protein-RMF3https:
License: http://creativecommons.org/licenses/by/4.0/
The gist: Few-step generative models can generate high-fidelity samples within a few function evaluations.
Terminology
Abstract
Few-step generative models can generate high-fidelity samples within a few function evaluations. Despite this efficiency, generated samples may not exhibit desirable properties. When these properties are difficult to encode as an explicit reward function, direct preference optimization (DPO) can align generative models using pairwise preference feedback without training a separate reward model. However, extending DPO to few-step generative models is challenging because few-step generative models are generally implicit, making the likelihood evaluation required by DPO intractable. To address this challenge, we introduce Few-step DPO (FestDPO), an extension of DPO for few-step generative models that leverages nonparametric likelihood estimation from empirical samples. By exploiting the fast sampling capabilities of few-step generative models, our approach makes sample-based approximation of DPO loss computationally feasible. Furthermore, the sample-based formulation makes FestDPO agnostic to the model family and sampling procedure. Our toy experiment demonstrates that FestDPO matches the reward-tilted target distribution across four few-step generators. For real-world tasks, we evaluate FestDPO in two domains: text-to-image generation and protein backbone generation. In text-to-image generation, FestDPO outperforms preference optimization baselines in both win rates against the base models and human evaluation scores. In protein backbone generation, it achieves a higher β-sheet fraction and better structural designability than the baselines.
Sources
- Iterated Denoising Energy Matching for Sampling from Boltzmann Densities
- Demystifying MMD GANs
- Flow map matching with stochastic interpolants: A mathematical framework for consistency models
- Reinforced sequential Monte Carlo for amortised sampling
- Generative Modeling via Drifting
- Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matching
- Flow Sampling: Learning to Sample from Unnormalized Densities via Denoising Conditional Processes
- Classifier-Free Diffusion Guidance
- LoRA: Low-Rank Adaptation of Large Language Models
- Drifting Preference Optimization for One-Step Generative Models
- Adam: A Method for Stochastic Optimization
- Auto-Encoding Variational Bayes
- Aligning Few-Step Generative Models by Amortizing Sample-based Variational Inference
- Reward Score Matching: Unifying Reward-based Fine-tuning for Flow and Diffusion Models
- Flow Matching for Generative Modeling
- Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow
- Decoupled Weight Decay Regularization
- DINOv2: Learning Robust Visual Features without Supervision
- Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learning
- Proximal Policy Optimization Algorithms
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks