LGAICLNov 12, 2024

Entropy Controllable Direct Preference Optimization

arXiv:2411.07595v22 citationsh-index: 4
AI Analysis

This incremental improvement addresses a specific bottleneck in aligning large language models with human preferences, making it more practical for training applications.

The paper tackles the issue in Direct Preference Optimization (DPO) where minimizing reverse KL divergence can fail to capture modes of the reference distribution, hurting policy performance, and proposes H-DPO, a modification that controls policy entropy to enhance sharpness and mode-seeking, showing it outperforms DPO in tasks like mathematical evaluations with superior pass@k results.

In the post-training of large language models (LLMs), Reinforcement Learning from Human Feedback (RLHF) is an effective approach to achieve generation aligned with human preferences. Direct Preference Optimization (DPO) allows for policy training with a simple binary cross-entropy loss without a reward model. The objective of DPO is regularized by reverse KL divergence that encourages mode-seeking fitting to the reference policy. Nonetheless, we indicate that minimizing reverse KL divergence could fail to capture a mode of the reference distribution, which may hurt the policy's performance. Based on this observation, we propose a simple modification to DPO, H-DPO, which allows for control over the entropy of the resulting policy, enhancing the distribution's sharpness and thereby enabling mode-seeking fitting more effectively. In our experiments, we show that H-DPO outperformed DPO across various tasks, demonstrating superior results in pass@$k$ evaluations for mathematical tasks. Moreover, H-DPO is simple to implement, requiring only minor modifications to the loss calculation of DPO, which makes it highly practical and promising for wide-ranging applications in the training of LLMs.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes