Skip to content
aiqbench takeAI Research

aiqbench analysis

This research investigates the robustness of information retrieval models against collection growth, finding that adding non-relevant documents inevitably degrades performance across both document-dependent and agnostic architectures. The study highlights a critical trade-off where Multi-Document-Agnostic (MDA) models generally outperform their dependent counterparts in standard retrieval tasks, though reranking capabilities remain comparable between the two approaches. These findings offer essential insights for engineers designing scalable search systems that must maintain efficacy as data volumes expand dynamically.
Sources coveringarXiv, LessWrong, AI Alignment Forum, Interconnects
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Robustness of IR Models to Collection Growth

arXiv2 min read

arXiv:2608.23419v1 Announce Type: cross Abstract: Information Retrieval (IR) systems seek to identify relevant documents within a collection. In practical applications, collections are dynamic, with documents frequently added. We argue that ideally, a retriever's effectiveness should not decrease when non-relevant documents are added to a collection. This study formalises this concept and empirically evaluates it by merging two collections with negligible topic overlap. We hypothesise that the way an IR model conditions its ranking on other documents in a collection (e.g., the IDF component in BM25 or contextual documents in listwise rerankers) plays an important role in its robustness to the addition of non-relevant documents. We broadly classify models as those that do not depend on other documents (Multi-Document-Agnostic, MDA) and those that do (Multi-Document-Dependent, MDD). Our results show that neither MDD nor MDA models are fully robust to the addition of non-relevant documents, as all models exhibit some performance degradation. Interestingly, among the models we test, MDA is more effective than MDD for retrieval, whereas MDD and MDA rerankers are equally effective.

Abstract:Information Retrieval (IR) systems seek to identify relevant documents within a collection. In practical applications, collections are dynamic, with documents frequently added. We argue that ideally, a retriever's effectiveness should not decrease when non-relevant documents are added to a collection. This study formalises this concept and empirically evaluates it by merging two collections with negligible topic overlap. We hypothesise that the way an IR model conditions its ranking on other documents in a collection (e.g., the IDF component in BM25 or contextual documents in listwise rerankers) plays an important role in its robustness to the addition of non-relevant documents. We broadly classify models as those that do not depend on other documents (Multi-Document-Agnostic, MDA) and those that do (Multi-Document-Dependent, MDD). Our results show that neither MDD nor MDA models are fully robust to the addition of non-relevant documents, as all models exhibit some performance degradation. Interestingly, among the models we test, MDA is more effective than MDD for retrieval, whereas MDD and MDA rerankers are equally effective.

Information Retrieval (cs.IR); Computation and Language (cs.CL)

arXiv:2608.23419 [cs.IR]

(or arXiv:2608.23419v1 [cs.IR] for this version)

https://doi.org/10.48550/arXiv.2608.23419 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

https://doi.org/10.1145/3799682.3839935 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 275 words

Related coverage