arXiv:2506.01317cs.LGcs.AI2025-06NeurIPS被引 13

通过筛选关键词粒度数据,用更少训练样本实现更强模型性能。

T-SHIRT: Token-Selective Hierarchical Data Selection for Instruction Tuning

  • 按词粒度评估指令质量,只保留高信息量词汇。
  • 在8个基准上用5%数据训练,性能比全量数据高出5.48分。
  • 适合追求高效训练与高性能的LLM研究者使用。

指令微调对大语言模型有效遵循用户指令至关重要。为提升训练效率并减少数据冗余,现有方法采用基于大语言模型的评分函数(如指令遵循难度)筛选得分高于阈值的高质量指令数据。然而,这些方法存在两大局限:(i) 在样本层面评估质量,忽略词粒度的信息性;(ii) 忽视评分方法的鲁棒性,常因表面词汇特征而非真实质量选择样本。本文提出一种新的数据选择框架T-SHIRT,引入新评分机制,仅包含有信息量的词进行质量评估,并鼓励邻近样本也具高质量,降低局部不一致性。实验表明,使用T-SHIRT从原数据集中仅选取5%样本进行指令微调,模型在8个基准上的平均性能超越全量数据训练模型达5.48分。该方法在多种大模型和训练集规模下均优于现有最优数据选择技术,同时兼具成本低、效率高优势。例如,使用GPT-2计算评分,可在单张GPU上40分钟内处理52,000条样本。代码已开源于https://github.com/Dynamite321/T-SHIRT。

原文摘要 · Abstract (English)

Instruction tuning is essential for Large Language Models (LLMs) to effectively follow user instructions. To improve training efficiency and reduce data redundancy, recent works use LLM-based scoring functions, e.g., Instruction-Following Difficulty (IFD), to select high-quality instruction-tuning data with scores above a threshold. While these data selection methods often lead to models that can match or even exceed the performance of models trained on the full datasets, we identify two key limitations: (i) they assess quality at the sample level, ignoring token-level informativeness; and (ii) they overlook the robustness of the scoring method, often selecting a sample due to superficial lexical features instead of its true quality. In this work, we propose Token-Selective HIeRarchical Data Selection for Instruction Tuning (T-SHIRT), a novel data selection framework that introduces a new scoring method to include only informative tokens in quality evaluation and also promotes robust and reliable samples whose neighbors also show high quality with less local inconsistencies. We demonstrate that models instruction-tuned on a curated dataset (only 5% of the original size) using T-SHIRT can outperform those trained on the entire large-scale dataset by up to 5.48 points on average across eight benchmarks. Across various LLMs and training set scales, our method consistently surpasses existing state-of-the-art data selection techniques, while also remaining both cost-effective and highly efficient. For instance, by using GPT-2 for score computation, we are able to process a dataset of 52k samples in 40 minutes on a single GPU. Our code is available at https://github.com/Dynamite321/T-SHIRT.

数据筛选指令微调高效训练

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