Drowning in Documents: Consequences of Scaling Reranker Inference
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 51 of its 71 references that are in the map. First posted on arXiv 18 Nov 2024.
Builds on
51 of 71 references.
References · 51
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,824
- 2020Learning to summarize from human feedbackcited by 2,588
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,745
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
- 2022Scaling Laws for Reward Model Overoptimizationcited by 1,095
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 991
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
38 more
- 2019Passage Re-ranking with BERTcited by 645
- 2020Fact or Fiction: Verifying Scientific Claimscited by 554
- 2024LLM2Vec: Large Language Models Are Secretly Powerful Text Encoderscited by 404
- 2022The Effects of Reward Misspecification: Mapping and Mitigating Misaligned Modelscited by 328
- 2023Fine-Tuning LLaMA for Multi-Stage Text Retrievalcited by 272
- 2023FinanceBench: A New Benchmark for Financial Question Answeringcited by 270
- 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 267
- 2024mGTE: Generalized Long-Context Text Representation and Reranking Models for Multilingual Text Retrievalcited by 236
- 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 214
- 2019Multi-Stage Document Ranking with BERTcited by 201
- 2019Certified Robustness to Adversarial Word Substitutionscited by 168
- 2019Poly-encoders: Transformer Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoringcited by 165
- 2024BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrievalcited by 158
- 2023RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!cited by 155
- 2024Scaling Laws for Reward Model Overoptimization in Direct Alignment Algorithmscited by 143
- 2022RankT5: Fine-Tuning T5 for Text Ranking with Ranking Lossescited by 115
- 2022Re2G: Retrieve, Rerank, Generatecited by 102
- 2021Rethink Training of BERT Rerankers in Multi-Stage Retrieval Pipelinecited by 65
- 2024Inference Scaling for Long-Context Retrieval Augmented Generationcited by 65
- 2018Learning a Deep Listwise Context Model for Ranking Refinementcited by 62
- 2024LongEmbed: Extending Embedding Models for Long Context Retrievalcited by 48
- 2023The Alignment Ceiling: Objective Mismatch in Reinforcement Learning from Human Feedbackcited by 42
- 2024Improving LLM Reasoning through Scaling Inference Computation with Collaborative Verificationcited by 40
- 2024Ragnar"ok: A Reusable RAG Framework and Baselines for TREC 2024 Retrieval-Augmented Generation Trackcited by 32
- 2024Scaling Laws For Dense Retrievalcited by 29
- 2024Towards a Search Engine for Machines: Unified Ranking for Multiple Retrieval-Augmented Large Language Modelscited by 23
- 2018Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networkscited by 22
- 2020Interpretable & Time-Budget-Constrained Contextualization for Re-Rankingcited by 21
- 2022In Defense of Cross-Encoders for Zero-Shot Retrievalcited by 21
- 2022RELIC: Retrieving Evidence for Literary Claimscited by 18
- 2024BIRCO: A Benchmark of Information Retrieval Tasks with Complex Objectivescited by 15
- 2024Top-Down Partitioning for Efficient List-Wise Rankingcited by 13
- 2023Can Query Expansion Improve Generalization of Strong Cross-Encoder Rankers?cited by 12
- 2020Choppy: Cut Transformer For Ranked List Truncationcited by 11
- 2018Strength in Numbers: Trading-off Robustness and Computation via Adversarially-Trained Ensemblescited by 8
- 2021A Systematic Evaluation of Transfer Learning and Pseudo-labeling with BERT-based Ranking Modelscited by 8
- 2023Policy-Gradient Training of Language Models for Rankingcited by 5
- 2024InstUPR : Instruction-based Unsupervised Passage Reranking with Large Language Modelscited by 3
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2025: 7; 2026: 1.
8 papers.
- 2025FinSage: A Multi-aspect RAG System for Financial Filings Question Answeringcited by 19
- 2025FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documentscited by 15
- 2025ORANSight-2.0: Foundational LLMs for O-RANcited by 13
- 2025ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Rerankingcited by 11
- 2025AI5GTest: AI-Driven Specification-Aware Automated Testing and Validation of 5G O-RAN Componentscited by 4
- 2025QuOTE: Question-Oriented Text Embeddingscited by 2
- 2026Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scalecited by 2
- 2025JointRank: Rank Large Set with Single Passcited by 1
- 2026Can Language Models Actually Retrieve In-Context? Drowning in Documents at Million Token Scale1 Jul 2026
- 2025JointRank: Rank Large Set with Single Pass27 Jun 2025
- 2025AI5GTest: AI-Driven Specification-Aware Automated Testing and Validation of 5G O-RAN Components11 Jun 2025
- 2025ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking4 Jun 2025
- 2025FinSage: A Multi-aspect RAG System for Financial Filings Question Answering20 Apr 2025
- 2025FreshStack: Building Realistic Benchmarks for Evaluating Retrieval on Technical Documents17 Apr 2025
- 2025ORANSight-2.0: Foundational LLMs for O-RAN7 Mar 2025
- 2025QuOTE: Question-Oriented Text Embeddings16 Feb 2025