English

Multi-Preference Optimization: Generalizing DPO via Set-Level Contrasts

Machine Learning 2025-06-23 v4 Artificial Intelligence Computation and Language

Abstract

Direct Preference Optimization (DPO) has become a popular approach for aligning language models using pairwise preferences. However, in practical post-training pipelines, on-policy generation typically yields multiple candidate responses per prompt, which are scored by a reward model to guide learning. In this setting, we propose Multi-Preference Optimization (MPO)\textbf{Multi-Preference Optimization (MPO)}, a generalization of DPO that optimizes over entire sets of responses by extending the Bradley-Terry model to groupwise comparisons between chosen and rejected sets. To further enhance learning, MPO employs deviation-based weighting, which emphasizes outlier responses that deviate most from the mean reward, effectively inducing a self-paced curriculum. We theoretically prove that MPO reduces alignment bias at a rate of O(1n)\mathcal{O}\left(\frac{1}{\sqrt{n}}\right) with respect to the number of responses per query. Empirically, MPO achieves state-of-the-art performance on the UltraFeedback benchmark and yields up to 17.5%\sim 17.5\% improvement over the state-of-the-art baseline in length-controlled win rate on AlpacaEval2, establishing a new baseline for preference-based alignment

Keywords

Cite

@article{arxiv.2412.04628,
  title  = {Multi-Preference Optimization: Generalizing DPO via Set-Level Contrasts},
  author = {Taneesh Gupta and Rahul Madhavan and Xuchao Zhang and Nagarajan Natarajan and Chetan Bansal and Saravan Rajmohan},
  journal= {arXiv preprint arXiv:2412.04628},
  year   = {2025}
}
R2 v1 2026-06-28T20:24:56.250Z