arXiv Computation and Language

Incremental Pooled LLM Evaluation for Cost-Effective Retrieval Model Selection

The paper proposes an incremental pooled LLM evaluation method for selecting retrieval models in production Retrieval-Augmented Generation (RAG) systems. By having a language model judge the union of documents retrieved by current candidates and expanding the pool only with new documents from added systems, the approach reuses judgments across all systems. Experiments on four benchmarks and a financial news QA deployment show strong correlation with gold-standard rankings, high preservation of pairwise orderings, and significant cost savings—up to 4.9× lower evaluation cost and 65–80% judgment reuse.

arXiv AI
Jul 1

RARE: Redundancy-Aware Retrieval Evaluation Framework for High-Similarity Corpora

arXiv:2604. 19047v2 Announce Type: replace-cross Abstract: Existing QA benchmarks typically assume distinct documents with minimal overlap, yet real-world retrieval-augmented generation (RAG) systems operate on corpora such as financial reports, legal codes, and patents, where information is highly redundant and documents exhibit strong inter-document similarity.

By Hanjun Cho, Jay-Yoon Lee
Hugging Face Trending Papers
Sep 8

Q2D-Web: A Large-Scale Benchmark for Retrieval in Agentic RAG Systems

Q2D-Web is a new large‑scale benchmark for agentic Retrieval‑Augmented Generation (RAG) systems, featuring a 190 million‑document web corpus and 70 k machine‑reformulated search queries in ten languages. It supplies three sets of relevance judgments—agent citations, production rankings, and a combined set enriched with LLM‑based labels—to evaluate first‑stage retrievers. Experiments on 13 retrievers show consistent ranking across judgment sets but significant variation across domains, languages, and query types, and demonstrate that a carefully sampled sub‑corpus can approximate full‑corpus evaluation with minimal loss in Recall@1000.

arXiv AI
Oct 5

Evaluating the Retrieval Robustness of Large Language Models

The paper evaluates how robust large language models (LLMs) are when using retrieval‑augmented generation (RAG) in practical settings. It investigates whether RAG always outperforms non‑RAG approaches, whether adding more retrieved documents helps, and whether the order of documents matters, using a benchmark of 1,891 samples across five datasets and three task categories. Experiments with 11 LLMs show generally high retrieval robustness, but performance varies by task and prompting strategy, indicating that adopting RAG should be considered on a case‑by‑case basis.

By Shuyang Cao, Karthik Radhakrishnan, David Rosenberg, Steven Lu, Pengxiang Cheng, Lu Wang, Shiyue Zhang
arXiv Computation and Language
Oct 16

Beyond Relevance-Centric Retrieval: Rubric-Oriented Document Set Selection and Ranking

The paper introduces SetwiseEvalKit, a benchmark with nine dimensions and 28K rubrics for evaluating document sets, highlighting that current rerankers only achieve up to 45% coverage and struggle with cross‑document coordination. It proposes Rubric4Setwise, a training‑free method that transforms rubric criteria into selection signals, outperforming other methods in downstream generation tasks across both short‑form and long‑form scenarios. The study demonstrates the importance of evaluating and optimizing document sets as a whole rather than independently.

By Kailin Jiang, Lei Liu, Jian Xi, Hui Xu, Junlin Liu, Baochen Fu, Bin Li, Vichwang, Yu Lu, Haibo Shi
arXiv Computation and Language
Aug 25

Robustness of IR Models to Collection Growth

The paper investigates how adding non‑relevant documents to a collection affects the performance of Information Retrieval (IR) models. It distinguishes between Multi‑Document‑Agnostic (MDA) models, which do not rely on other documents, and Multi‑Document‑Dependent (MDD) models, which do, and evaluates both on two collections with little topic overlap. Results show that all models suffer some performance loss when non‑relevant documents are added, but MDA models outperform MDD models in retrieval tasks, while both perform similarly in reranking.

By Emmanouil Georgios Lionis, Debasis Ganguly, Sean MacAvaney
arXiv Computation and Language
Sep 22

Re:CAP - Auditing Retrieval Coverage in Production RAG Pipelines

Re:CAP is a reference‑free audit loop for retrieval‑augmented generation (RAG) pipelines that probes for missing documents instead of enumerating all relevant ones. It identifies covered topics, generates probing questions, retrieves candidate documents, and uses an LLM judge to keep only those that add new information. On several benchmarks, Re:CAP recovers a significant portion of gold documents that flat BM25 or hybrid retrieval misses, and human evaluation shows most of these documents add new information.

By Aviral Joshi, Hanoz Bhathena, Max Nelson, Saket Sharma
arXiv Computation and Language
Oct 22

Scan or Index? large Evidence Coverage, Answer Quality, and Cost in Long-Document RAG

The study compares 11 retrieval configurations for long-document Retrieval-Augmented Generation (RAG), including lexical, dense, hybrid reranking, and full-document scanning methods. Using 396 QASPER questions and 80 textbook questions, the hybrid approach with Jev achieved the highest evidence coverage (94.1%) and the hybrid with Decisions yielded the best answer accuracy (0.892), despite lower evidence recovery. Full scanning offers higher coverage but incurs higher latency and cost, while reusable dense retrieval is cheaper as queries accumulate.

By Juan Terven, Diana-Margarita C\'ordova-Esparza, Julio-Alejandro Romero-Gonz\'alez, Edgar Chavez-Urbiola, Juan Irving Vasquez, Julian Andres Ramirez-Bautista, Silvia L. Chaparro-C\'ardenas, Gendry Alfonso-Francia
arXiv Computation and Language
Aug 27

Less can be More: Relieving RAG Bottlenecks via Evidence Frontloading and Pressure-Adaptive Budgeting

The paper introduces “PACE”, a training‑free framework that tackles bottlenecks in Retrieval‑Augmented Generation by frontloading evidence and adaptively budgeting reranking. It first reorders candidate documents based on marginal evidence coverage—prioritizing query‑relevant, complementary, and chain‑forming documents—providing a $(1-1/e)$ approximation guarantee. Then it dynamically adjusts the reranking budget according to the relative pressure of the reranker and the language model, improving evidence recall and reducing p95 latency in multi‑hop QA workloads.

By Weibin Cai, Reza Zafarani
arXiv AI
5d ago

Adaptive Query Routing: A Tier-Based Framework for Hybrid Retrieval Across Financial, Legal, and Medical Documents

The paper evaluates three retrieval strategies—Vector RAG, Tree Reasoning, and a new Adaptive Hybrid Retrieval (AHR)—on a small corpus of financial, legal, and medical documents, using a four‑tier query complexity benchmark and LLM‑as‑judge evaluation. Tree Reasoning achieves the highest overall score (0.900), but AHR excels on cross‑reference queries (0.850) and all methods tie on multi‑section queries (0.929). Vector RAG shows the lowest latency (1.61 s) and performs best on single multi‑document queries (0.900).

By Afshan Hashmi