分析大模型判断相关性时的系统性偏差,发现错误集中在特定语义集群。
Query-Document Dense Vectors for LLM Relevance Judgment Bias Analysis
- 将查询与文档映射到联合语义空间,用聚类识别相关性判断模式
- 实验显示人类与大模型的分歧集中在特定语义簇,非随机分布
- 可定位大模型在定义类、政策类等场景下的重复失败点
大语言模型(LLMs)因成本低、可扩展性强,被广泛用于信息检索评估集创建,替代人工相关性判断。以往研究关注大模型平均表现,本文则聚焦其是否会产生系统性误判。为此,提出一种新型查询-文档(Q-D)表示方法,将相关性视为关系属性,嵌入联合语义空间,并构建基于聚类的分析框架。在TREC Deep Learning 2019和2020数据集上的实验表明,人类与大模型的相关性判断分歧集中于特定语义簇,而非随机分布。查询层面分析揭示,大模型在定义类、政策类及模糊情境下频繁出错;在多个簇间一致性差异大的查询中,存在明显分歧热点,表现为漏检相关文档或误纳入无关内容。该框架结合全局诊断与局部聚类,揭示了大模型判断中的隐藏弱点,助力实现更透明、可靠的检索评估。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have been used as relevance assessors for Information Retrieval (IR) evaluation collection creation due to reduced cost and increased scalability as compared to human assessors. While previous research has looked at the reliability of LLMs as compared to human assessors, in this work, we aim to understand if LLMs make systematic mistakes when judging relevance, rather than just understanding how good they are on average. To this aim, we propose a novel representational method for queries and documents that allows us to analyze relevance label distributions and compare LLM and human labels to identify patterns of disagreement and localize systematic areas of disagreement. We introduce a clustering-based framework that embeds query-document (Q-D) pairs into a joint semantic space, treating relevance as a relational property. Experiments on TREC Deep Learning 2019 and 2020 show that systematic disagreement between humans and LLMs is concentrated in specific semantic clusters rather than distributed randomly. Query-level analyses reveal recurring failures, most often in definition-seeking, policy-related, or ambiguous contexts. Queries with large variation in agreement across their clusters emerge as disagreement hotspots, where LLMs tend to under-recall relevant content or over-include irrelevant material. This framework links global diagnostics with localized clustering to uncover hidden weaknesses in LLM judgments, enabling bias-aware and more reliable IR evaluation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。