让大模型重点学关键信息,提升指令对齐效果
SFT-GO: Supervised Fine-Tuning with Group Optimization for Large Language Models
- 按重要性分组优化token,动态聚焦难点部分
- 在多个基准上超越基线,提升稳定性和泛化能力
- 适合需要精准对齐的下游任务和大模型微调
监督微调(SFT)是使大语言模型对齐人类期望和特定下游任务的关键步骤。然而,现有SFT方法通常将每个训练样本视为均匀序列,对所有标记赋予相同重要性,忽略了仅部分标记包含关键任务信息的事实。为此,我们提出基于分组优化的监督微调(SFT-GO),根据标记的重要性值对每样本中的标记进行分组,并采用最差分组损失与标准交叉熵损失的加权组合来优化模型。该机制自适应强调最具挑战性的标记组,引导模型更好处理不同组的分布差异,从而改善整体学习动态。我们提供了SFT-GO收敛速率的理论分析,证明其高效性。实验表明,使用三种不同的标记分组策略,SFT-GO训练的模型在多个主流LLM基准上持续优于基线方法,且在不同数据集和基础模型上均表现稳健,验证了该方法的有效性与鲁棒性。
原文摘要 · Abstract (English)
Supervised fine-tuning (SFT) has become an essential step in tailoring large language models (LLMs) to align with human expectations and specific downstream tasks. However, existing SFT methods typically treat each training instance as a uniform sequence, giving equal importance to all tokens regardless of their relevance. This overlooks the fact that only a subset of tokens often contains critical, task-specific information. To address this limitation, we introduce Supervised Fine-Tuning with Group Optimization (SFT-GO), a novel approach that treats groups of tokens differently based on their importance.SFT-GO groups tokens in each sample based on their importance values and optimizes the LLM using a weighted combination of the worst-group loss and the standard cross-entropy loss. This mechanism adaptively emphasizes the most challenging token groups and guides the model to better handle different group distributions, thereby improving overall learning dynamics. We provide a theoretical analysis of SFT-GO's convergence rate, demonstrating its efficiency. Empirically, we apply SFT-GO with three different token grouping strategies and show that models trained with SFT-GO consistently outperform baseline approaches across popular LLM benchmarks. These improvements hold across various datasets and base models, demonstrating the robustness and the effectiveness of our method.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。