Alignment & Preference Learning · 2023

Direct Preference Optimization (DPO)

Rafael Rafailov, Archit Sharma, Eric Mitchell, Stefano Ermon, Christopher Manning, Chelsea Finn

Showed the RLHF objective can be solved by a single classification-style loss on preference pairs, eliminating the separate reward model and reinforcement-learning loop.

Editorial record

Plain-language summary

Direct Preference Optimization uses the mathematical link between reward and optimal policy to rewrite preference learning so the language model itself is optimized directly on chosen-versus-rejected examples with a simple supervised loss. There is no reward model to train and no PPO sampling, so it is more stable and cheaper while matching or beating PPO-based RLHF on preference tuning. This made preference alignment practical for teams without reinforcement-learning infrastructure.

Knowledge graph

Relationships

Antecedents

Descendants

Source record

Provenance

Record ID
P-205
Record created
2026-07-13
Last reviewed
2026-07-14
Record version
2

Citation caveat: Citation metadata is approximate and marked unverified in the source dataset.