Back to LLMs Mind Map
中文·English
LLMsID: dpo

Direct Preference Optimization

DPO 直接偏好优化
🎯Core Definition
DPO (Direct Preference Optimization) is an alignment method that removes the need for a reward model and RL. Key insight: RLHF's reward model implicitly defines an optimal policy; DPO substitutes that closed-form solution back into the objective, the partition function Z(x)Z(x) cancels out, and training becomes supervised on preference pairs (chosen/rejected), with a loss that only depends on the policy/reference probability ratio.
💡Use Cases
aligning LLMs to human preferences (safety, style, helpfulness) whenever preference data exists as contrastive pairs; a lightweight RLHF alternative and the default choice for open-source fine-tuning.
Key Problems Solved
RLHF needs reward-model training + online sampling + PPO (4 stages) — complex and unstable; DPO does alignment in one supervised step, dropping the reward model and the RL loop, cutting memory and compute dramatically.
🎯5 High-Frequency Exam Points
1
What's the core difference between DPO and RLHF? Why does DPO need no reward model or RL?
2
Walk through the DPO loss derivation: how does the partition function Z(x) cancel out?
3
What does the β hyperparameter mean in DPO? Effects of large vs small β?
4
How do DPO and GRPO differ, and when would you use each?
5
DPO limitations: why is it sensitive to preference-data quality, and what role does the reference model play?
Updated 2026-08-11
🎯
Test Your Knowledge: Practice Questions for "Direct Preference Optimization"
Single choice pitfall questions with instant feedback and mistake tracking.
🚀 Start Card Practice
Previous CardPPO Clipped ObjectiveNext CardReference-Free Alignment SimPO/ORPO/KTO

🔗 More LLMs Knowledge Cards

Agent & Tool CallingAlignment Tax & Preference DataScaled Dot-Product AttentionAttention Variants MHA/MQA/GQA