Get the 2026 ML Training Cookbook | 52 recipes — GRPO, Flow Matching, World Models, and everything in between Download Now →
Preference Optimization
Align language model outputs with human preferences using direct preference pairs, eliminating the need for a separate reward model during training. Direct Preference Optimization (DPO) reformulates RLHF without a reward model. Given pairs of preferred/rejected responses, DPO directly optimizes the policy to maximize the log-likelihood of preferred responses while penalizing the rejected ones, using a closed-form mapping between reward functions and optimal policies. Variants like KTO use unpaired preferences and IPO uses a squared-error loss for more stable optimization.
Papers, code, and datasets
Direct Preference Optimization: Your Language Model is Secretly a Reward Model
Read on arXiv ↗
KTO: Model Alignment as Prospect Theoretic Optimization
Read on arXiv ↗
IPO: A General Framework for Preference Optimization
Read on arXiv ↗
ORPO: Monolithic Preference Optimization without Reference Model
Read on arXiv ↗
Datasets & ModelsWant to explore this concept?
Whether you're evaluating preference optimization for your workflow or need help implementing it, we can help.