#artificial intelligence
Jan 2026
Continuous-Utility Direct Preference Optimization
It is proved that learning with K strategies yields a Theta(K log K) improvement in sample complexity over binary preferences and that DPO converges to the entropy-regularized utility-maximizing policy.
M. Mohsin, Muhammad Umer, Ahsan Bilal et al.
· arXiv.org · 0 citations