Listwise Generative Retrieval Models Via A Sequential Learning Process

Abstract

Recently, a novel generative retrieval (GR) paradigm has been proposed, where a single sequence-to-sequence model is learned to directly generate a list of relevant document identifiers (docids) given a query. Existing GR models commonly employ maximum likelihood estimation (MLE) for optimization: this involves maximizing the likelihood of a single relevant docid given an input query, with the assumption that the likelihood for each docid is independent of the other docids in the list. We refer to these models as the pointwise approach in this paper. While the pointwise approach has been shown to be effective in the context of GR, it is considered sub-optimal due to its disregard for the fundamental principle that ranking involves making predictions about lists. In this paper, we address this limitation by introducing an alternative listwise approach, which empowers the GR model to optimize the relevance at the docid list level. Specifically, we view the generation of a ranked docid li

Stats

• citations13
• S2 citations—
• github stars0
• HF likes0
• heat score8.60
• arxiv keytang2024listwise

Related papers

• Generative Retrieval Meets Multi-graded Relevance (2024)2.26
• Learning To Rank In Generative Retrieval (2023)11.91
• Continual Learning For Generative Retrieval Over Dynamic Corpora (2023)11.49
• Generative Retrieval As Multi-vector Dense Retrieval (2024)8.60
• Lightweight And Direct Document Relevance Optimization For Generative Information Retrieval (2025)4.52
• Does Generative Retrieval Overcome The Limitations Of Dense Retrieval? (2025)0.00
• Multi-step Semantic Reasoning In Generative Retrieval (2026)0.00
• Generative Dense Retrieval: Memory Can Be A Burden (2024)4.52