In plain words: Instead of only re-scoring a short list from a first-stage search, they tested rerankers on hard, fresh tasks while scoring more and more documents. Quality improved at first, then dropped as the list grew, sometimes falling below the plain search alone.
Abstract
Rerankers, typically cross-encoders, are computationally intensive but are frequently used because they are widely assumed to outperform cheaper initial IR systems. We challenge this assumption by measuring reranker performance for full retrieval, not just re-scoring first-stage retrieval. To provide a more robust evaluation, we prioritize strong first-stage retrieval using modern dense embeddings and test rerankers on a variety of carefully chosen, challenging tasks, including internally curated datasets to avoid contamination, and out-of-domain ones. Our empirical results reveal a surprising trend: the best existing rerankers provide initial improvements when scoring progressively more documents, but their effectiveness gradually declines and can even degrade quality beyond a certain limit. We hope that our findings will spur future research to improve reranking.
Mathew Jacob, Erik Lindgren, Matei Zaharia, Michael Carbin, Omar Khattab, Andrew Drozdov
arXiv:2411.11767 · cs.IR, cs.CL, cs.LG · submitted Nov 18, 2024 · updated Jul 11, 2025
abstract · pdf · html · Accepted to ReNeuIR 2025 Workshop at SIGIR 2025 Conference