Length Desensitization in Direct Preference Optimization

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Liu, Wei, Bai, Yang, Han, Chengcheng, Weng, Rongxiang, Xu, Jun, Cao, Xuezhi, Wang, Jingang, Cai, Xunliang
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915038684512256
author Liu, Wei
Bai, Yang
Han, Chengcheng
Weng, Rongxiang
Xu, Jun
Cao, Xuezhi
Wang, Jingang
Cai, Xunliang
author_facet Liu, Wei
Bai, Yang
Han, Chengcheng
Weng, Rongxiang
Xu, Jun
Cao, Xuezhi
Wang, Jingang
Cai, Xunliang
contents Direct Preference Optimization (DPO) is widely utilized in the Reinforcement Learning from Human Feedback (RLHF) phase to align Large Language Models (LLMs) with human preferences, thereby enhancing both their harmlessness and efficacy. However, it has been observed that DPO tends to over-optimize for verbosity, which can detrimentally affect both performance and user experience. In this paper, we conduct an in-depth theoretical analysis of DPO's optimization objective and reveal a strong correlation between its implicit reward and data length. This correlation misguides the optimization direction, resulting in length sensitivity during the DPO training and leading to verbosity. To address this issue, we propose a length-desensitization improvement method for DPO, termed LD-DPO. The proposed method aims to desensitize DPO to data length by decoupling explicit length preference, which is relatively insignificant, from the other implicit preferences, thereby enabling more effective learning of the intrinsic preferences. We utilized two settings (Base and Instruct) of Llama2-13B, Llama3-8B, and Qwen2-7B for experimental validation on various benchmarks including MT-Bench and AlpacaEval 2. The experimental results indicate that LD-DPO consistently outperforms DPO and other baseline methods, achieving more concise responses with a 10-40% reduction in length compared to DPO. We conducted in-depth experimental analyses to demonstrate that LD-DPO can indeed achieve length desensitization and align the model more closely with human-like preferences.
format Preprint
id arxiv_https___arxiv_org_abs_2409_06411
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Length Desensitization in Direct Preference Optimization
Liu, Wei
Bai, Yang
Han, Chengcheng
Weng, Rongxiang
Xu, Jun
Cao, Xuezhi
Wang, Jingang
Cai, Xunliang
Machine Learning
Computation and Language
Direct Preference Optimization (DPO) is widely utilized in the Reinforcement Learning from Human Feedback (RLHF) phase to align Large Language Models (LLMs) with human preferences, thereby enhancing both their harmlessness and efficacy. However, it has been observed that DPO tends to over-optimize for verbosity, which can detrimentally affect both performance and user experience. In this paper, we conduct an in-depth theoretical analysis of DPO's optimization objective and reveal a strong correlation between its implicit reward and data length. This correlation misguides the optimization direction, resulting in length sensitivity during the DPO training and leading to verbosity. To address this issue, we propose a length-desensitization improvement method for DPO, termed LD-DPO. The proposed method aims to desensitize DPO to data length by decoupling explicit length preference, which is relatively insignificant, from the other implicit preferences, thereby enabling more effective learning of the intrinsic preferences. We utilized two settings (Base and Instruct) of Llama2-13B, Llama3-8B, and Qwen2-7B for experimental validation on various benchmarks including MT-Bench and AlpacaEval 2. The experimental results indicate that LD-DPO consistently outperforms DPO and other baseline methods, achieving more concise responses with a 10-40% reduction in length compared to DPO. We conducted in-depth experimental analyses to demonstrate that LD-DPO can indeed achieve length desensitization and align the model more closely with human-like preferences.
title Length Desensitization in Direct Preference Optimization
topic Machine Learning
Computation and Language
url https://arxiv.org/abs/2409.06411