arXiv News

First-hand information for everyone

Site

AboutPrivacy PolicyTerms of Use

© 2026 arXiv News

New Retrieval Pipeline Boosts Coverage Without Sacrificing Relevance on a Complex Question Dataset | arXiv News

arXiv News

EnglishJapanese

Switch language

EnglishJapanese
Loading account…

First-hand information for everyone

Back to front page
Information RetrievalEnglishPublished

New Retrieval Pipeline Boosts Coverage Without Sacrificing Relevance on a Complex Question Dataset

November 2, 2026arXiv: 2610.40314v1

A retrieval system that splits questions into subquestions and selects documents for maximal coverage improves the α‑nDCG@10 score from 0.625 to 0.702 on the TREC RAG 2024 benchmark. The method first trains a bi‑encoder to score documents for each subquestion, then predicts a document‑×‑subquestion coverage matrix with a cross‑encoder, and finally picks documents by greedy maximum‑marginal coverage. In the benchmark, adding coverage training raises α‑nDCG@10 from 0.625 to 0.656, and the subsequent selection stage adds another 0.046, reaching 0.702. A gold‑oracle selector that feeds the exact coverage matrix further improves the score to 0.887, showing the upper bound.

Table of α‑nDCG@10, StRecall@10, P@10 and nDCG@10 for a relevance‑trained bi‑encoder, with incremental gains from coverage training and from the coverage‑aware greedy selector, the last entry achieving 0.702.
Methodα-nDCG@10StRecall@10P@10nDCG@10
Relevance-trained bi-encoder0.6250.7440.7540.784
+ coverage training0.6560.7620.7730.798
+ coverage estimator and greedy selection0.7020.7700.7750.800
Gold nuggets (decomposition upper bound)0.7180.7810.7710.802
Oracle greedy (selection upper bound)0.8870.8580.8000.857
Table 1. Retrieval results on TREC RAG 2024 showing that coverage‑aware training and greedy selection raise α‑nDCG@10 from 0.625 to 0.702.Tu, He, Kurumthottam, Aleena Bosco, Suel, Torsten · arXiv:2610.40314v1 · Table 1: · CC BY 4.0

Compared to a relevance‑only baseline, the coverage‑aware method achieves a higher transfer rate (+0.050) and a higher sentence precision (+0.070) on TREC RAG 2024, though none of the five metrics remain statistically significant after Holm–Bonferroni correction.

Table summarizing five downstream evaluation metrics for three systems – bi‑encoder relevance, coverage‑aware, and oracle – with the coverage‑aware system attaining higher transfer rate and sentence precision relative to the relevance baseline.
ABO
Metricnbi-encoderoursoracleΔ(B−O)
StRecall@10 (retrieval)540.7910.7990.888−0.089‡
Transfer rate540.2940.3260.275+0.050†
Answer StRecall540.2390.2660.247+0.020
Vstrict510.3500.3510.322+0.029
Sentence precision530.7150.7110.642+0.070†
Table 3. Downstream metrics comparing the coverage‑aware system to a relevance‑only baseline show higher transfer rate (+0.050) and sentence precision (+0.070) but no significant difference after Holm–Bonferroni correction.Tu, He, Kurumthottam, Aleena Bosco, Suel, Torsten · arXiv:2610.40314v1 · Table 3: · CC BY 4.0

Despite higher retrieved coverage, an oracle selector that covers more nuggets does not deliver more of them to the answer. The relationship between retrieved coverage and answer coverage is not monotonic, suggesting that simply adding more evidence does not automatically improve the final answer.

These findings highlight how explicitly modeling coverage can sharpen the breadth of retrieved evidence while maintaining relevance, but also reveal that more retrieved coverage does not always translate to more complete answers.

Source paper

Decompose, Estimate, Select: Coverage-Aware Context Construction for Long-Form RAG

Information Retrieval
View on arXiv