arXiv:2609.08762cs.IR2026-09

让文档通过多个片段标识符被检索,提升多意图查询的匹配效果。

PDMR: Passage-Driven Multi-ID Document Retrieval

  • 将文档拆分为片段,每个片段分配唯一标识符,实现多入口检索。
  • 在NQ320K和MS MARCO上,召回率@1和MRR@100均优于现有方法。
  • 适合需要精准匹配文档多维度内容的场景,如复杂问答系统。

生成式检索(GR)模型直接将查询映射到文档标识符,取代传统基于外部稀疏或稠密索引的检索方式。然而,多数生成式检索框架依赖单标识符假设,即每个文档仅对应一个目标序列,迫使模型用单一序列表达全部内容。由于文档常具多面性,这可能导致信息损失并降低对查询变化的鲁棒性,使多个查询意图竞争同一生成路径。本文提出段落驱动的多标识符检索(PDMR),通过多个段落级标识符表示文档。PDMR将文档分段,并为每个选中段落分配一个标识符,为同一文档提供多个语义入口。该多入口表示使模型能与特定语义方面对齐查询,从而减少对单文档级目标的依赖。为解决此一对多映射带来的监督模糊性,我们将训练建模为多目标学习问题,并设计了一种分布概率质量于多个有效段落级标识符的目标函数。在NQ320K和MS MARCO Document数据集上评估显示,PDMR在召回率@1和MRR@100上优于强基线;在MS MARCO Document上,其在召回率@1和MRR@10上均达最优,同时在召回率@10上保持竞争力。受控消融实验进一步表明,段落级监督、标识符设计、训练时查询增强和多目标学习带来互补增益。

原文摘要 · Abstract (English)

Generative Retrieval (GR) models map queries directly to document identifiers, replacing conventional retrieval over external sparse or dense indexes with autoregressive identifier generation. However, most generative retrieval frameworks rely on a single-identifier assumption, mapping each document to a single target sequence. This forces the model to represent all document content with one sequence. Since documents are often multi-faceted, this can lead to lossy representations and reduced robustness to query variation, where multiple query intents must compete for a single generative access path. In this work, we introduce Passage-Driven Multi-ID Retrieval (PDMR), a generative retrieval framework that represents documents through multiple passage-level identifiers. PDMR segments each document and assigns one identifier to each selected passage, which provides multiple semantic entry points for retrieving the same document. This multi-entry representation allows the model to align queries with specific semantic facets, thereby reducing the dependence on a single document-level target. To address the supervision ambiguity of this one-to-many mapping, we formulate training as a multi-target learning problem and explore an objective function designed to distribute probability mass across multiple valid passage-level identifiers. We evaluate PDMR on NQ320K and MS MARCO Document. On NQ320K, PDMR improves over strong generative and non-generative baselines on Recall@1 and MRR@100. On MS MARCO Document, PDMR achieves the best Recall@1 and MRR@10 among the reported methods, while remaining competitive on Recall@10. Controlled ablations further show that passage-level supervision, identifier design, training-query augmentation, and multi-target learning contribute complementary gains.

生成式检索多标识符文档检索

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