用语言模型快速筛选数据,让主动学习更高效。
Language Model-Driven Data Pruning Enables Efficient Active Learning
- 先用n-gram模型快速评估,再用量化大模型选高质量样本。
- 在多个任务上实现最高标注效率,端到端时间减少74%。
- 适合大规模数据主动学习,尤其关注计算效率的研究者。
主动学习通过选择最有信息量的样本进行标注来提升标注效率。其核心是选择函数,用于从大量未标注数据中挑选合适样本。然而,现有方法在处理大规模未标注数据时计算开销巨大,限制了其在大数据集上的应用。为此,我们提出一种可即插即用的未标注数据剪枝策略 ActivePrune,利用语言模型对未标注池进行剪枝。该方法采用两阶段流程:首先使用n-gram语言模型的困惑度分数进行快速初步评估;随后通过量化大模型计算数据质量指标进行高质量样本筛选。此外,为增强未标注池的多样性,我们设计了一种新的困惑度重加权方法,系统性地推动低频样本在后续标注迭代中被优先选择。在翻译、情感分析、主题分类和摘要生成四个不同任务、四个数据集及四种主动学习策略上的实验表明,ActivePrune显著优于现有数据剪枝方法。最终,我们对比了各剪枝方法的选择质量与效率权衡,证明 ActivePrune 在计算效率上优于其他基于LLM得分的剪枝方法,端到端主动学习时间最多可减少74%。
原文摘要 · Abstract (English)
Active learning (AL) optimizes data labeling efficiency by selecting the most informative instances for annotation. A key component in this procedure is an acquisition function that guides the selection process and identifies the suitable instances for labeling from the unlabeled pool. However, these acquisition methods suffer from high computational costs with large unlabeled data pools, posing a roadblock to their applicability on large datasets. To address this challenge and bridge this gap, we introduce a novel plug-and-play unlabeled data pruning strategy, ActivePrune, which leverages language models to prune the unlabeled pool. ActivePrune implements a two-stage pruning process: an initial fast evaluation using perplexity scores from an n-gram language model, followed by a high-quality selection using metrics for data quality computed through a quantized LLM. Additionally, to enhance the diversity in the unlabeled pool, we propose a novel perplexity reweighting method that systematically brings forward underrepresented instances for selection in subsequent labeling iterations. Experiments on translation, sentiment analysis, topic classification, and summarization tasks on four diverse datasets and four active learning strategies demonstrate that ActivePrune outperforms existing data pruning methods. Finally, we compare the selection quality $\leftrightarrow$ efficiency tradeoff of the data pruning methods and demonstrate that ActivePrune is computationally more efficient than other LLM score-based pruning methods, and provides up to 74% reduction in the end-to-end time required for active learning.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。