用理论支撑的主动选择方法,高效提升大模型对齐效果
ActiveDPO: Active Direct Preference Optimization for Sample-Efficient Alignment
- 基于非线性奖励函数的理论数据筛选准则
- 利用模型自身参数化奖励模型,提升选数据效率
- 适合需要减少标注成本的大模型对齐场景
近期利用人类偏好对齐大语言模型(LLMs)取得显著进展,显著提升了其在问答、数学推理和代码生成等下游任务中的表现。然而,有效对齐依赖高质量的人类偏好数据集。收集这些数据需人工标注,成本高昂,亟需高效的主动数据选择方法。现有方法或缺乏坚实的理论基础,或依赖线性潜在奖励函数等限制性假设。为此,我们提出 ActiveDPO 算法,采用理论支持的数据选择标准,适用于非线性奖励函数,并直接利用待对齐的 LLM 自身来参数化用于主动选择的奖励模型。由此,ActiveDPO 明确考虑了模型对数据选择的影响,区别于不考虑被对齐模型的方法,实现更高效的数据收集。大量实验表明,ActiveDPO 在多种模型与真实偏好数据集上均优于现有方法。
原文摘要 · Abstract (English)
The recent success in using human preferences to align large language models (LLMs) has significantly improved their performance in various downstream tasks, such as question answering, mathematical reasoning, and code generation. However, achieving effective LLM alignment depends on high-quality datasets of human preferences. Collecting these datasets requires human preference annotation, which is costly and resource-intensive, necessitating efficient active data selection methods. Existing methods either lack a strong theoretical foundation or depend on restrictive assumptions about the reward function, such as linear latent reward functions. To this end, we propose an algorithm, ActiveDPO, that uses a theoretically grounded data selection criterion for non-linear reward functions while directly leveraging the LLM itself to parameterize the reward model used for active data selection. As a result, ActiveDPO explicitly accounts for the LLM's influence on data selection, unlike methods that select data without considering the LLM that is being aligned, thereby leading to more effective and efficient data collection. Our extensive experiments demonstrate that ActiveDPO outperforms existing methods across various models and real-world preference datasets.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。