Entropy Controllable Direct Preference Optimization
Motoki Omura, Yasuhiro Fujita, Toshiki Kataoka

TL;DR
This paper introduces H-DPO, an entropy-controllable modification of DPO, improving policy mode-seeking in LLM training by adjusting entropy, leading to better performance in mathematical tasks.
Contribution
H-DPO provides a simple way to control policy entropy in DPO, enhancing mode-seeking and performance without complex changes.
Findings
H-DPO outperforms DPO in pass@k evaluations for math tasks.
H-DPO is easy to implement with minor loss modifications.
Entropy control improves mode coverage in policy training.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Multi-Criteria Decision Making · Metaheuristic Optimization Algorithms Research
MethodsDirect Preference Optimization
