Sign inGet started
Paper · arXiv

Statistical Learning Theory for Direct Preference Optimization

Direct Preference Optimization (DPO) learns from pairwise preferences through a logistic objective whose score-difference parameterization follows the Bradley--Terry model. We study how failure of this modeling assumption limits DPO, distinguishing structural misspecification from limited model capacity and finite-sample estimation. Our main contribution is a characterization of structural approximation error through the triangle-curl of the preference log-odds, which vanishes exactly when preferences admit a Bradley--Terry representation. We upper bound the achievable excess logistic risk by a score-class approximation term and a triangle-curl term, and establish a lower bound proportion...

AuthorsJoel Wills, Yuanfan Li, Yiming Ying et al.
Primary categorycs.LG
Published19 October 2026
Last updated at source19 October 2026
cs.LGstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/0f7760c5-924f-4c0a-8f9f-8d43794b5b9a" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 20 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.