$$\texttt{C2-DPO}$$: Constrained Controlled Direct Preference Optimization

Direct preference optimization (\texttt{DPO}) has emerged as a promising approach for solving the alignment problem in AI. In this paper, we make two counter-intuitive observations about \texttt{DPO}. First, we show that the \texttt{DPO} loss could be derived by starting from an alternative optimization problem that only defines the KL guardrail on in-sample responses, unlike the original RLHF problem where guardrails are defined on the entire distribution. Second, we prove a surprising property of this alternative optimization problem, where both the preferred and rejected responses tend to decrease in probability under its optimal policy, a phenomenon typically displayed by DPO in practice. To control this behavior, we propose a set of constraints designed to limit the displacement of probability mass between the preferred and rejected responses in the reference and target policies. The resulting algorithm, which we call Constrained Controlled DPO (\texttt{C2-DPO}), has a meaningful RLHF interpretation. By hedging against the displacement, \texttt{C2-DPO} provides practical improvements over vanilla \texttt{DPO} when aligning several language models using standard preference datasets.

Authors

• Kavosh Asadi
• Xingzi Xu
• Julien Han
• Ege Beyazit
• Idan Pipano Technion - Israel Institute of Technology, Israel
• Dominique Perrault-Joncas
• Shoham Sabach
• Mohammad Ghavamzadeh Google Research
• Karim Bouyarmane

Keywords

No keywords are indexed for this paper.