基于困惑度的智能选数据,用1%数据达到全量训练效果
PPL-Factory: Task-Aware and Budget-Aware Data Selection from Language Modeling to Reasoning
- 按任务类型区分语言建模与推理任务,用困惑度评估样本价值
- 仅用1%数据超越其他方法,10%数据在GSM8K上比全量训练高0.9分
- 适合追求高效微调的开发者,尤其在资源受限场景下
并非所有训练样本对大模型微调都同等重要。选择有信息量的样本可在保持下游性能的同时降低计算成本。现有数据选择方法多依赖间接启发式规则,如数据质量、多样性或推理轨迹长度,但这些固定标准的效果受任务影响,难以跨任务泛化。基于困惑度的数据选择能直观反映样本难度,但现有方法通常对整个序列打分,忽略了语言建模与推理任务学习目标的差异。本文提出PPL-Factory,一个简单可解释的数据选择框架,结合任务感知的困惑度评分与数据预算感知的选择策略。在GSM8K上的实验表明,PPL-Factory仅使用1%的训练集即超越其他先进方法;使用10%数据时,在GSM8K上准确率高于全数据微调0.9分,在MATH上高4.8分。结果表明,任务感知与预算感知的困惑度选择是高效微调的有效且通用方案。
原文摘要 · Abstract (English)
Not all training samples contribute equally to large language model fine-tuning. Selecting informative training samples can reduce the computational cost while preserving downstream performance. Many existing data selection methods rely on indirect heuristics, such as data quality, diversity or reasoning trace length. However, the effectiveness of these fixed criteria is task-dependent and difficult to generalize across diverse downstream tasks. Perplexity-based data selection provides a simple and model-aware solution to estimate the sample difficulty, but existing approaches typically score the entire training sequence and ignore the difference in learning objectives of language modeling and reasoning tasks. In this paper, we propose PPL-Factory, a simple and interpretable data selection framework that combines task-aware perplexity-based scores and data budget-aware selection criteria. Experiments on GSM8K demonstrate that PPL-Factory outperforms other state-of-the-art data selection methods using only $1\%$ of the training set. With $10\%$ of the data, PPL-Factory exceeds full-data fine-tuning accuracy by 0.9 on GSM8K and 4.8 on MATH. Overall, our results demonstrate that task-aware and budget-aware perplexity-based selection provides an effective and applicable approach for efficient fine-tuning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。