paper-with-me

Papers

Lightweight and Direct Document Relevance Optimization for Generative Information Retrieval

2025-04-07 · Kidist Amde Mekonnen, Yubao Tang, Maarten de Rijke

Generative information retrieval (GenIR) is a promising neural retrieval paradigm that formulates document retrieval as a document identifier (docid) generation task, allowing for end-to-end optimization toward a unified global retrieval objective. However, existing GenIR models suffer from token-level misalignment, where models trained to predict the next token often fail to capture document-level relevance effectively. While reinforcement learning-based methods, such as reinforcement learning from relevance feedback (RLRF), aim to address this misalignment through reward modeling, they introduce significant complexity, requiring the optimization of an auxiliary reward function followed by reinforcement fine-tuning, which is computationally expensive and often unstable. To address these challenges, we propose direct document relevance optimization (DDRO), which aligns token-level docid generation with document-level relevance estimation through direct optimization via pairwise ranking, eliminating the need for explicit reward modeling and reinforcement learning. Experimental results on benchmark datasets, including MS MARCO document and Natural Questions, show that DDRO outperforms reinforcement learning-based methods, achieving a 7.4% improvement in MRR@10 for MS MARCO and a 19.9% improvement for Natural Questions. These findings highlight DDRO's potential to enhance retrieval effectiveness with a simplified optimization approach. By framing alignment as a direct optimization problem, DDRO simplifies the ranking optimization pipeline of GenIR models while offering a viable alternative to reinforcement learning-based methods.

📄 PDF Abstract BibTeX arXiv:2504.05181

Code (2)

kidist-amde/ddro 공식 구현 pytorch
kidist-amde/ddro-direct-document-relevance-optimization 공식 구현 pytorch

Tasks

Information RetrievalNatural Questionsreinforcement-learningReinforcement LearningRetrieval

Similar Papers 제목 키워드 기반

Scalable and Effective Generative Information Retrieval

2023-11-15 · Hansi Zeng, Chen Luo, Bowen Jin, Sheikh Muhammad Sarwar 외

Recent research has shown that transformer networks can be used as differentiable search indexes by representing each document as a sequences of document ID tokens. These generative retrieval models cast the retrieval pr…

Information RetrievalRetrieval

Generative Retrieval Meets Multi-Graded Relevance

2024-09-27 · Yubao Tang, Ruqing Zhang, Jiafeng Guo, Maarten de Rijke 외

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…

DecoderInformation RetrievalRetrieval

GRM: Generative Relevance Modeling Using Relevance-Aware Sample Estimation for Document Retrieval

2023-06-16 · Iain Mackie, Ivan Sekulic, Shubham Chatterjee, Jeffrey Dalton 외

Recent studies show that Generative Relevance Feedback (GRF), using text generated by Large Language Models (LLMs), can enhance the effectiveness of query expansion. However, LLMs can generate irrelevant information that…

Document RankingRetrieval

A Lightweight Constrained Generation Alternative for Query-focused Summarization

2023-04-23 · Zhichao Xu, Daniel Cohen

Query-focused summarization (QFS) aims to provide a summary of a document that satisfies information need of a given query and is useful in various IR applications, such as abstractive snippet generation. Current QFS app…

Language ModelingLanguage ModellingLarge Language ModelQuery-focused Summarization+1

Lightweight Relevance Grader in RAG

2025-06-17 · Taehee Jeong

Retrieval-Augmented Generation (RAG) addresses limitations of large language models (LLMs) by leveraging a vector database to provide more accurate and up-to-date information. When a user submits a query, RAG executes a …

Language ModelingLanguage ModellingRAGRetrieval-augmented Generation+1