arXiv:2606.13204cs.IR2026-06

让检索系统理解查询中的否定和排除约束,避免误选反向内容。

CoDeR: Local Constraint-Compatible Retrieval Beyond Semantic Similarity

论文配图:CoDeR: Local Constraint-Compatible Retrieval Beyond Semantic Similarity
图 1 · 摘自论文原文
  • 分离主题相关性和约束兼容性,用双编码器学习约束方向
  • 在三类否定测试中,最高降低23.53分的错误检出率
  • 无需调用大模型,推理快且适合严格约束场景

信息检索系统长期以语义相似性作为相关性的代理。对于约束敏感型查询,当文档虽主题接近但违背约束方向(如包含应排除的属性或肯定应否定的关系)时,该代理会失效。我们将其归因于约束违反证据的暴露,并提出CoDeR——一种局部约束兼容的稠密检索方法,将主题相关性与约束兼容性分离。CoDeR保留标准的主题编码器以覆盖候选文档,新增一个兼容性评分器(双编码器结构),通过对比正负样本的词汇极性监督进行训练。该兼容性信号可用于重排序主题候选,或检索独立的兼容性导向候选集,生成最终排名列表,且推理时无需外部大语言模型调用。我们在受控诊断和公开的负向约束检索基准上评估了CoDeR。在针对反义、否定和排除的三类受控诊断集中,相对于最强的非CoDeR基线,CoDeR分别将V@2降低了20.59、23.53和5.77点,并通过将首个违反约束的文档推后排名来提升FVR。

原文摘要 · Abstract (English)

Information retrieval systems have long treated semantic similarity as a proxy for relevance. For constraint-sensitive queries, this proxy can fail when a document is topically close to the query but supports the opposite constraint direction, such as satisfying an attribute that should be excluded or affirming a relation that should be negated. We study this failure as constraint-violating evidence exposure and propose CoDeR, a local constraint-compatible dense retrieval method that separates topical relevance from constraint compatibility. CoDeR keeps a standard topical encoder for candidate coverage and adds a compatibility scorer, implemented as a bi-encoder, trained with lexical-polarity supervision over contrastive satisfying and violating evidences. The compatibility signal can be used to rescore topical candidates or to retrieve an auxiliary compatibility-oriented candidate set, producing a ranked document list without external Large Language Model~(LLM) calls at inference time. We evaluate CoDeR on controlled diagnostics and public negative-constraint retrieval benchmarks. Across three controlled diagnostic sets targeting antonymy, negation, and exclusion, CoDeR reduces V@2 by 20.59, 23.53, and 5.77 points relative to the strongest non-CoDeR baselines, and improves FVR by pushing the first violating document deeper in the ranking.

检索增强约束推理稠密检索

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。