The results identify condition coverage, rather than gold discovery alone, as the central bottleneck for conjunctive document retrieval, and page-aware visual systems surface stored support for every condition on only 5.3% of queries.
Abstract
Finding a long document relevant to a multi-part request is not the same as establishing that it contains every requested piece of evidence. We study this gap for conjunctive document retrieval, where two or three explicit conditions must be supported on different pages of one document. We use n-Clue as a controlled measurement instrument: 1{,}000 queries over 2{,}021 documents pair all-condition golds with naturally occurring documents that satisfy only a subset, and a complete-first success requires a top-10 gold to precede every released subset qrel. Across 70 configurations, condition-wise decomposition improves two dense backbones by 6.8--7.3 points and lexical--visual fusion adds 8.7, while four generic rerankers all reduce Gold-NDCG; these directions replicate on a four-source stress set. Scaling one dense family from 0.6B to 8B changes complete-first success by 0.0 points. The strongest displayed hybrid illustrates the resulting gap: it finds a gold for 81.1\% of queries but succeeds complete-first on only 35.8\%, and the gap persists across condition count, target length, candidate density, query rendering, and the four-source stress set. Finally, page-aware visual systems surface stored support for every condition on only 5.1--5.3\% of queries. These results identify condition coverage, rather than gold discovery alone, as the central bottleneck.
Document retrieval is a crucial component of many modern AI systems, directly influencing their effectiveness, robustness, and fairness in downstream tasks. While recent years have seen a growing number of retrievers, comparative studies in the literature are typically limited in scope or focused on singular benchmarks...
Correct page selection, rather than semantic retrieval in isolation, is identified as the main opportunity for improvement in this setting of retrieval-augmented generation, with higher latency and more detected output artifacts.
It is shown that duplicate redundancy and LLM paraphrasing does not significantly improve answer correctness, however, providing diverse documents is highly beneficial, improving answer correctness by 17%-47%.
Jonathan J. Ross, B. Koopman, A. H. van der Vegt et al.· 2 citations
Results show that observed evidence can guide graph retrieval toward the part of a supporting chain left underspecified by the original question, and introduce EviReform, which separates revising the retrieval request from aggregating evidence in the graph.
Dual-Bounded Relational Recall is tested with Dual-Bounded Relational Recall, which allocates a fixed retrieval budget between relevance-selected seeds and bounded graph-adjacent context against matched flat top-k retrieval using the same relevance-ranking stage and the same maximum number of retrieval units and tokens...
Thomson D. Nguy· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.