让检索系统学会找有逻辑关联的段落,提升多跳问答准确率。
Association Is Not Similarity: Learning Corpus-Specific Associations for Multi-Hop Retrieval
- 用小模型学习段落间的关联关系,基于共现标注进行对比学习。
- 在HotpotQA上召回率提升8.6点,难问题提升28.5点,效果显著。
- 适合需要推理链的问答任务,且计算开销极低,无需大模型索引。
密集检索系统通过嵌入相似性排序段落,但多跳问题需要通过共享推理链相关联的段落。我们提出关联增强检索(AAR),一种轻量级的归纳重排方法,使用一个小MLP(420万参数)在嵌入空间中通过共现标注的对比学习,训练段落间的关联关系。推理时,AAR利用双向关联评分对初始候选集进行重排。在HotpotQA上,AAR将段落召回率@5从0.831提升至0.916(+8.6点),无需评估集调优,且在困难问题上提升达+28.5点。在MuSiQue上,归纳设置下提升+10.1点。在训练集关联上训练、验证集为未见关联的归纳模型无显著提升,表明该方法捕捉的是语料特定共现关系而非可迁移模式。消融实验支持此结论:使用语义相似但无关联的段落对训练会劣于基线,打乱关联对导致严重退化。下游问答评估显示,检索提升带来+6.4点精确匹配增益。该方法每查询增加3.7ms延迟,在单张GPU上训练少于两分钟,无需基于LLM的索引。
原文摘要 · Abstract (English)
Dense retrieval systems rank passages by embedding similarity to a query, but multi-hop questions require passages that are associatively related through shared reasoning chains. We introduce Association-Augmented Retrieval (AAR), a lightweight transductive reranking method that trains a small MLP (4.2M parameters) to learn associative relationships between passages in embedding space using contrastive learning on co-occurrence annotations. At inference time, AAR reranks an initial dense retrieval candidate set using bi-directional association scoring. On HotpotQA, AAR improves passage Recall@5 from 0.831 to 0.916 (+8.6 points) without evaluation-set tuning, with gains concentrated on hard questions where the dense baseline fails (+28.5 points). On MuSiQue, AAR achieves +10.1 points in the transductive setting. An inductive model trained on training-split associations and evaluated on unseen validation associations shows no significant improvement, suggesting that the method captures corpus-specific co-occurrences rather than transferable patterns. Ablation studies support this interpretation: training on semantically similar but non-associated passage pairs degrades retrieval below the baseline, while shuffling association pairs causes severe degradation. A downstream QA evaluation shows retrieval gains translate to +6.4 exact match improvement. The method adds 3.7ms per query, trains in under two minutes on a single GPU, and requires no LLM-based indexing.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。