aiqbench analysis
This research provides a rigorous theoretical foundation for TF-IDF and BM25 by demonstrating their equivalence to exact Kullback-Leibler divergences within a unified probabilistic framework. By clarifying the statistical interpretation of these classic information retrieval metrics, the study enables direct theoretical comparisons with other methods rather than relying solely on experimental benchmarks. This advancement strengthens the mathematical underpinnings of natural language processing and search algorithms central to AI systems.
TF-IDF and BM25 Are Exact KL Divergences
arXiv:2609.14016v1 Announce Type: cross Abstract: TF-IDF and BM25 are two of the most widely used methods for scoring query-document relevance, yet neither has a standard probabilistic derivation that justifies it as a statistical method within a unified framework. We address this gap by showing that both scoring methods admit an exact interpretation as Kullback-Leibler divergences between two probability models. We treat the BM25 variant that includes the plus 1 correction in the IDF term, which is the one used in practice, and also discuss the original BM25 formulation without that correction. The resulting framework provides a common theoretical basis for TF-IDF and BM25, clarifies what they measure, and allows them to be compared theoretically with other information retrieval methods rather than only experimentally.
Abstract:TF-IDF and BM25 are two of the most widely used methods for scoring query-document relevance, yet neither has a standard probabilistic derivation that justifies it as a statistical method within a unified framework. We address this gap by showing that both scoring methods admit an exact interpretation as Kullback-Leibler divergences between two probability models. We treat the BM25 variant that includes the plus 1 correction in the IDF term, which is the one used in practice, and also discuss the original BM25 formulation without that correction. The resulting framework provides a common theoretical basis for TF-IDF and BM25, clarifies what they measure, and allows them to be compared theoretically with other information retrieval methods rather than only experimentally.
Information Retrieval (cs.IR); Computation and Language (cs.CL)
arXiv:2609.14016 [cs.IR]
(or arXiv:2609.14016v1 [cs.IR] for this version)
https://doi.org/10.48550/arXiv.2609.14016 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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 · 216 words
Related coverage
CeQe: Grounding Lexical Retrieval in Semantic Evidence
arXiv · Aug 5, 2026

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · Sep 27, 2026

III. Anthropic reasoning has issues with infinite worlds; D-SIA can fix this
LessWrong · Aug 3, 2026
Untrusted advice for AI control: Short, strong advice significantly uplifts weak LLMs
LessWrong · Jul 27, 2026