让大模型先列候选标签,再用小模型筛选,提升标注质量
Prompt Candidates, then Distill: A Teacher-Student Framework for LLM-driven Data Annotation
- 大模型不确定时输出所有可能标签,避免误标
- 小模型通过教师-学生框架从候选中提炼唯一标签
- 在6个文本分类任务中显著优于单标签方法
大型语言模型(LLMs)在数据标注中展现出巨大潜力,显著降低下游应用的劳动成本。然而,现有方法通常采用激进策略,强制大模型为每个未标注样本确定单一标准标签。由于大模型固有的不确定性,对困难样本常产生错误标签,严重损害下游任务的数据质量。受人类规避模糊行为的启发,我们提出一种新的候选标注范式:当大模型存在不确定性时,鼓励其输出所有可能标签。为确保下游任务获得唯一标签,我们设计了教师-学生框架CanDist,由小型语言模型(SLM)对候选标签进行蒸馏。我们进一步提供严格理论证明,表明从教师大模型中蒸馏候选标签,相比直接使用单标签,具有更优的理论保证。在六个文本分类任务上的大量实验验证了该方法的有效性。源代码已公开于https://github.com/MingxuanXia/CanDist。
原文摘要 · Abstract (English)
Recently, Large Language Models (LLMs) have demonstrated significant potential for data annotation, markedly reducing the labor costs associated with downstream applications. However, existing methods mostly adopt an aggressive strategy by prompting LLM to determine a single gold label for each unlabeled sample. Due to the inherent uncertainty within LLMs, they often produce incorrect labels for difficult samples, severely compromising the data quality for downstream applications. Motivated by ambiguity aversion in human behaviors, we propose a novel candidate annotation paradigm wherein large language models are encouraged to output all possible labels when incurring uncertainty. To ensure unique labels are provided for downstream tasks, we develop a teacher-student framework CanDist that distills candidate annotations with a Small Language Model (SLM). We further provide a rigorous justification demonstrating that distilling candidate annotations from the teacher LLM offers superior theoretical guarantees compared to directly using single annotations. Extensive experiments across six text classification tasks validate the effectiveness of our proposed method. The source code is available at https://github.com/MingxuanXia/CanDist.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。