用特定主题分类器替代大模型判断相关性,提升检索评估可靠性。
Topic-Specific Classifiers are Better Relevance Judges than Prompted LLMs
- 为每个主题训练专用相关性分类器,基于单个评估员标注微调。
- 仅需128条人工标注即可使排序相关性超过0.94(斯皮尔曼ρ)。
- 比大模型判官更可靠,且避免评估循环问题,适合评测人员使用。
未标注文档问题是信息检索中测试集合复用的关键障碍:未参与原始标注的文档被检索后缺乏相关性判断。当前主流做法是将未标注文档视为无关,但已有多种替代方案,如使用大语言模型作为相关性判官(LLM-as-a-judge)。然而该方法受到批评,例如存在评估循环问题——同一模型既用于排序又用于判断。本文提出训练特定主题的相关性分类器:通过在单一评估员对某一主题的标注数据上独立微调monoT5并使用LoRA权重适配,使模型契合该评估员对相关性的理解。使用该分类器进行相关性判断所获得的系统排序与真实排序之间的斯皮尔曼ρ相关系数超过0.94。每主题仅需128条初始人工标注即可显著提升模型可比性,优于将未标注文档视为无关的做法,并且比现有LLM判官方案更可靠。该方法轻量、直接,同时保持人类标注为评估金标准。代码、模型与数据已开源。
原文摘要 · Abstract (English)
The unjudged document problem, where systems that did not contribute to the original judgement pool may retrieve documents without a relevance judgement, is a key obstacle to the reuseability of test collections in information retrieval. While the de facto standard to deal with the problem is to treat unjudged documents as non-relevant, many alternatives have been proposed, such as the use of large language models (LLMs) as a relevance judge (LLM-as-a-judge). However, this has been criticized, among other things, as circular, since the same LLM can be used as the ranker and the judge. We propose to train topic-specific relevance classifiers instead: By finetuning monoT5 with independent LoRA weight adaptation on the judgments of a single assessor for a single topic's pool, we align it to that assessor's notion of relevance for the topic. The system rankings obtained through our classifier's relevance judgments achieve a Spearmans' $ρ$ correlation of $>0.94$ with ground truth system rankings. As little as 128 initial human judgments per topic suffice to improve the comparability of models, compared to treating unjudged documents as non-relevant, while achieving more reliability than existing LLM-as-a-judge approaches. Topic-specific relevance classifiers are thus a lightweight and straightforward way to tackle the unjudged document problem, while maintaining human judgments as the gold standard for retrieval evaluation. Code, models, and data are made openly available.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。