← All concepts

preference optimization

Preference optimization trains AI models by comparing pairs of outputs, a preferred and a rejected one, so the model learns to favor the better choice. Methods like Direct Preference Optimization (DPO) use these comparisons directly, avoiding handcrafted rewards, and are applied to improve reasoning, safety, and generation quality.

Across the studies, preference optimization consistently boosts efficiency and performance, such as reducing computation or hallucination rates, but reveals key pitfalls. Standard approaches can uniformly penalize rejected responses even when parts are useful, and optimal settings vary by task and model, meaning that reusing configurations often fails. Careful, tailored tuning is essential for success.

Papers
66
Released code
2
First seen
June 2026
Latest
Nov 2026

62 papers in the last two months, against 3 in the two before.

Start here

Three papers to read first, in the order they came out
  1. 1AI agents cut prompt injection success from 79% to 9%

    SecPO combines a new training objective with strong simulated attacks to cut prompt-injection success while preserving performance on benign tasks.

    Nov 2026
  2. 2Debate traces yield useful training data when confidence replaces voting

    AbCD converts multi-agent debate traces into preference data by clustering answers and ranking by confidence, improving reasoning without gold labels.

    Nov 2026
  3. 3Language models can climb leaderboards by up to 45 places

    Large-language-model leaderboards that aggregate pairwise preferences with the Bradley-Terry model can be manipulated by strategic voting, prompting, and nomination.

    Nov 2026

Who is working on it

Stanford University 4Alibaba Group 4NVIDIA 4UC Berkeley 3Shanghai Jiao Tong University 3University of Science and Technology of China 3

The papers

Most central to this idea first, not most recent.

Concepts are extracted from each paper and reused across the corpus, so this page grows on its own as the desk reads.