Shifting from Ranking to Set Selection for Retrieval Augmented Generation

Dahyun Lee, Yongrae Jo, Haeju Park, Moontae Lee
7/9/2025
cs.CLcs.IR

Official code: LGAI-Research/SetR (28 stars, BSD-3-Clause, last commit 2025-09-11).

Abstract

Retrieval in Retrieval-Augmented Generation(RAG) must ensure that retrieved passages are not only individually relevant but also collectively form a comprehensive set. Existing approaches primarily rerank top-k passages based on their individual relevance, often failing to meet the information needs of complex queries in multi-hop question answering. In this work, we propose a set-wise passage selection approach and introduce SETR, which explicitly identifies the information requirements of a query through Chain-of-Thought reasoning and selects an optimal set of passages that collectively satisfy those requirements. Experiments on multi-hop RAG benchmarks show that SETR outperforms both proprietary LLM-based rerankers and open-source baselines in terms of answer correctness and retrieval quality, providing an effective and efficient alternative to traditional rerankers in RAG systems. The code is available at https://github.com/LGAI-Research/SetR

View on arXivView PDF

Code Implementations(1)

LGAI-Research/SetROfficial100%
BSD-3-Clause
281Shell, PythonMay 29, 20251 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{lee2025shifting,
  title  = {Shifting from Ranking to Set Selection for Retrieval Augmented Generation},
  author = {Dahyun Lee and Yongrae Jo and Haeju Park and Moontae Lee},
  year   = {2025},
  eprint = {2507.06838},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.06838v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.06838.svg)](https://codeofpaper.com/paper/2507.06838)

Discussion