arXiv:2506.17252cs.LGcs.AI2025-06NeurIPS被引 14

动态调整训练样本,让大模型对齐更高效。

Adaptive Batch-Wise Sample Scheduling for Direct Preference Optimization

  • 根据模型学习状态自适应选样,提升优化效率。
  • 不改核心算法,性能显著提升,开销极小。
  • 适合关注大模型对齐与训练优化的研究者。

直接偏好优化(DPO)已成为对齐大语言模型(LLM)与人类偏好的有效方法,但其性能高度依赖于人类偏好数据的质量。现有数据选择策略常忽略模型在优化过程中的动态变化。本文提出新的问题:针对DPO的样本调度,旨在基于模型在优化过程中每批的演化状态,动态自适应地调度训练样本。为此,我们提出高效且有效的算法SamS,通过利用语言模型的学习反馈,在每个训练批次中自适应选择样本,以最大化潜在的泛化性能。值得注意的是,无需修改核心DPO算法,仅集成SamS即可在多个任务上显著提升性能,且计算开销极低。该工作为通过批级样本选择改进大模型对齐提供了新方向,具有推广至强化学习人类反馈(RLHF)及更广泛监督学习范式潜力。

原文摘要 · Abstract (English)

Direct Preference Optimization (DPO) has emerged as an effective approach for aligning large language models (LLMs) with human preferences. However, its performance is highly dependent on the quality of the underlying human preference data. To address this bottleneck, prior work has explored various data selection strategies, but these methods often overlook the impact of the evolving states of the language model during the optimization process. In this paper, we introduce a novel problem: Sample Scheduling for DPO, which aims to dynamically and adaptively schedule training samples based on the model's evolving batch-wise states throughout preference optimization. To solve this problem, we propose SamS, an efficient and effective algorithm that adaptively selects samples in each training batch based on the LLM's learning feedback to maximize the potential generalization performance. Notably, without modifying the core DPO algorithm, simply integrating SamS significantly improves performance across tasks, with minimal additional computational overhead. This work points to a promising new direction for improving LLM alignment through batch-wise sample selection, with potential generalization to RLHF and broader supervised learning paradigms.

大模型对齐样本调度优化算法

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