arXiv:2502.16825cs.CL2025-02ACL被引 10

通过优化偏好数据构造,提升大模型对齐效果。

Finding the Sweet Spot: Preference Data Construction for Scaling Preference Optimization

  • 用重复随机采样扩大样本量,重新设计偏好对构造方式。
  • 选择奖励值在μ-2σ处的拒绝样本,性能优于最低奖励样本。
  • 适合需要大规模对齐训练的模型优化研究者使用。

迭代数据生成与模型重训是大语言模型对齐的常用方法,通常依赖策略模型生成在线响应,奖励模型指导数据筛选。直接偏好优化(DPO)进一步构建选中与拒绝响应的偏好对。本文旨在通过重复随机采样扩大在线样本数量以提升对齐性能。传统做法选取最高奖励样本作为选中项、最低奖励为拒绝项,但实验发现,随着样本规模增加,性能反而下降。为此,我们从样本奖励的潜在正态分布视角出发,将奖励空间划分为七个代表性点,系统探索全部21种(C₇²)组合。在四个模型上基于AlpacaEval 2的评估表明,将拒绝样本选在μ-2σ位置而非最小奖励处,对最优性能至关重要。最终提出一种可扩展的偏好数据构造策略,在样本规模增大时仍能持续提升模型表现。

原文摘要 · Abstract (English)

Iterative data generation and model retraining are widely used to align large language models (LLMs). It typically involves a policy model to generate on-policy responses and a reward model to guide training data selection. Direct Preference Optimization (DPO) further enhances this process by constructing preference pairs of chosen and rejected responses. In this work, we aim to \emph{scale up} the number of on-policy samples via repeated random sampling to improve alignment performance. Conventional practice selects the sample with the highest reward as chosen and the lowest as rejected for DPO. However, our experiments reveal that this strategy leads to a \emph{decline} in performance as the sample size increases. To address this, we investigate preference data construction through the lens of underlying normal distribution of sample rewards. We categorize the reward space into seven representative points and systematically explore all 21 ($C_7^2$) pairwise combinations. Through evaluations on four models using AlpacaEval 2, we find that selecting the rejected response at reward position $μ- 2σ$ rather than the minimum reward, is crucial for optimal performance. We finally introduce a scalable preference data construction strategy that consistently enhances model performance as the sample scale increases.

模型对齐偏好优化数据构造

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。