BM25 在大规模语料中胜出：检索增强生成范式的规模扩展研究

View PDF HTML (experimental)

Abstract:Retrieval-augmented generation (RAG) spans lexical and dense retrieval, graph-based indexing, and agentic search, but these paradigms are usually evaluated on different benchmarks at one corpus size, leaving their accuracy-cost scaling unclear. To bridge this gap, we present a controlled study that varies corpus size along 28 strictly nested tiers spanning roughly 450-fold, while holding questions and a fixed bedrock of relevant and adversarial documents unchanged. Under one reader model and one judging protocol, we measure official accuracy, construction and query tokens, and latency. The results reveal a scale-dependent crossover rather than an unconditional winner. File-System Agent leads at the smallest shared tiers, but its sequential exploration costs 39 times more query tokens at the bedrock and becomes less effective as the search space grows. Around 10 million corpus tokens, BM25 overtakes it and leads at every larger shared tier, with a margin approaching 20 points at full scale. BM25 also anchors the low-cost end of the Pareto frontier without LLM-based construction. Dense retrieval remains efficient but less accurate, whereas graph-based RAG encounters construction walls before deployment scale and its scalable variants remain below BM25 at shared tiers. Overall, corpus growth increasingly favors global candidate ranking: lexical retrieval is the strongest scalable default, while agentic reasoning works best after ranked discovery rather than in place of it.

Subjects:	Computation and Language (cs.CL)
Cite as:	arXiv:2607.26497 [cs.CL]
	(or arXiv:2607.26497v3 [cs.CL] for this version)
	https://doi.org/10.48550/arXiv.2607.26497 arXiv-issued DOI via DataCite

Submission history

From: Pengyu Wang [view email]
[v1] Wed, 29 Jul 2026 05:46:11 UTC (984 KB)
[v2] Thu, 30 Jul 2026 07:49:41 UTC (3,434 KB)
[v3] Fri, 31 Jul 2026 12:57:39 UTC (7,332 KB)