用专家可靠性建模提升嘈杂标注下的大模型微调效果
REALM: Reliable Expertise-Aware Language Model Fine-Tuning from Noisy Annotations
- 通过联合学习标注者可靠性和模型参数,无需额外信息
- 在4个真实众包数据集上平均提升2.9分,5个问答任务上平均提升5.0分
- 能自动识别标注者可靠性,适合有质量不一标注的场景
大语言模型的监督微调依赖人工标注数据,但标注常由不同专业水平的众包人员完成。传统方法仅用多数投票或简单平均,忽略标注者身份,导致不可靠标注被模型吸收。我们提出REALM,完全无监督地为每个标注者学习一个可靠性分数,仅需标注者身份信息。核心思想是将每个标签建模为模型预测与随机猜测的混合,权重由标注者可靠性决定。该方法适用于固定标签集的任务,可通过学习的可靠性矩阵扩展至多任务。在4个包含真实众包标注的文本分类数据集上,REALM在全部12种配置中表现最佳,平均优于最强基线(包括多数投票和Dawid–Skene聚合)2.9分。在5个问答基准的模拟噪声标签设置下,162种配置中152次超越朴素噪声微调,平均提升5.0分,且收益随模型规模增大而增长。此外,所学可靠性分数可准确恢复标注者真实可信度,而无需真实标签。代码已开源:https://github.com/sajjad-ucsb/REALM
原文摘要 · Abstract (English)
Supervised fine-tuning of large language models relies on human-annotated data, yet annotation pipelines routinely involve multiple crowdworkers of heterogeneous expertise. Standard practice aggregates labels via majority vote or simple averaging, discarding annotator identity and causing the model to absorb the errors of unreliable annotators into its parameters. We propose REALM, which jointly learns the model parameters and a scalar expertise value for each annotator, entirely unsupervised and requiring nothing beyond annotator identity. The key idea is to model each observed label as a mixture between the model's prediction and a uniform random guess, weighted by the annotator's learned expertise. REALM applies to any task with a fixed label set, and extends to multiple tasks via a learned expertise matrix. On four text-classification datasets with \emph{real} crowdsourced annotations, REALM is the best method in all $12$ configurations of the three heterogeneous-annotator datasets, improving on the strongest applicable baseline, including majority vote and Dawid--Skene aggregation, by $+2.9$ points on average. On five question answering benchmarks with simulated noisy labels, it outperforms naive noisy fine-tuning in $152$ of $162$ configurations, by $+5.0$ points on average, with gains that grow with model capacity. The learned expertise additionally recovers annotator reliability without ever observing it. Our code is available at https://github.com/sajjad-ucsb/REALM
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。