让生成式检索支持多级相关性,提升文档标识的区分度与准确性
Generative Retrieval Meets Multi-Graded Relevance
- 通过生成器与自编码器联合优化,生成语义相关且互异的文档标识符
- 设计多级约束对比训练,根据相关等级调整查询与文档表示距离
- 在多级与二元相关数据集上均验证了方法有效性,适合需要细粒度排序的场景
生成式检索是一种新型信息检索方法,采用编码器-解码器架构直接生成与查询相关的文档标识符(docids)。现有方法仅适用于二元相关性场景,忽略了文档可能具有多级相关性的潜力。将生成式检索扩展至多级相关性面临挑战:需协调文档标识对的概率似然,以及多个相关文档共享同一标识符的可能性。为此,我们提出GRaded Generative Retrieval(GR$^2$)框架。该框架包含两个核心组件:确保相关且互异的标识符,以及实现多级约束对比训练。首先,通过联合优化标识符的相关性与区分度,利用标识符生成与自编码器模型生成有效标识符;其次,引入相关等级间关系信息,采用约束对比训练策略,依据相关等级将查询与相关文档标识符的表示拉近。在包含多级与二元相关性的多个数据集上的大量实验表明,GR$^2$具有显著有效性。
原文摘要 · Abstract (English)
Generative retrieval represents a novel approach to information retrieval. It uses an encoder-decoder architecture to directly produce relevant document identifiers (docids) for queries. While this method offers benefits, current approaches are limited to scenarios with binary relevance data, overlooking the potential for documents to have multi-graded relevance. Extending generative retrieval to accommodate multi-graded relevance poses challenges, including the need to reconcile likelihood probabilities for docid pairs and the possibility of multiple relevant documents sharing the same identifier. To address these challenges, we introduce a framework called GRaded Generative Retrieval (GR$^2$). GR$^2$ focuses on two key components: ensuring relevant and distinct identifiers, and implementing multi-graded constrained contrastive training. First, we create identifiers that are both semantically relevant and sufficiently distinct to represent individual documents effectively. This is achieved by jointly optimizing the relevance and distinctness of docids through a combination of docid generation and autoencoder models. Second, we incorporate information about the relationship between relevance grades to guide the training process. We use a constrained contrastive training strategy to bring the representations of queries and the identifiers of their relevant documents closer together, based on their respective relevance grades. Extensive experiments on datasets with both multi-graded and binary relevance demonstrate the effectiveness of GR$^2$.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。