๐ค AI Summary
To address the low utilization efficiency of preference data and heavy reliance on large-scale human annotations in aligning large language models (LLMs), this paper proposes a difficulty-aware preference data selection method grounded in the implicit reward gap derived from Direct Preference Optimization (DPO). The core innovation lies in the first use of the reward difference implicitly learned during DPO training as a sample difficulty metric, enabling selection of highly discriminative, high-difficulty preference pairs. Crucially, the method requires no additional annotation or model fine-tuning, facilitating efficient, high-quality data curation. Experiments demonstrate that, using only 10% of the original preference data, our approach consistently outperforms five strong baselines across multiple benchmark datasets and alignment tasksโyielding substantial improvements in both data efficiency and alignment performance.
๐ Abstract
Aligning large language models (LLMs) with human preferences is a critical challenge in AI research. While methods like Reinforcement Learning from Human Feedback (RLHF) and Direct Preference Optimization (DPO) are widely used, they often rely on large, costly preference datasets. The current work lacks methods for high-quality data selection specifically for preference data. In this work, we introduce a novel difficulty-based data selection strategy for preference datasets, grounded in the DPO implicit reward mechanism. By selecting preference data examples with smaller DPO implicit reward gaps, which are indicative of more challenging cases, we improve data efficiency and model alignment. Our approach consistently outperforms five strong baselines across multiple datasets and alignment tasks, achieving superior performance with only 10% of the original data. This principled, efficient selection method offers a promising solution for scaling LLM alignment with limited resources.