bm25q: A More Memory-Efficient BM25 Retrieval
xhluca · x · 2026-07-17
A paper introduces bm25q, an extension of bm25s that achieves sparse BM25 retrieval with lower memory bandwidth while maintaining exact floating-point retrieval results.
The author reports speedup improvements over bm25s on two benchmarks:
- A 2.60× speedup on Natural Questions
- A 4.77× speedup on MSMARCO
The core objective is to make eager sparse retrieval significantly more efficient without compromising retrieval accuracy.
More from Research
- LLM leaderboards are now often measuring the harness too, Gary Marcus warns — GaryMarcus · 2026-07-22
- New paper defines self-state attacks, showing OS defenses leave four agent-memory cases indistinguishable — Justgototheeffinmoon · 2026-07-22
- Krea 2 users recommend a two-pass Clownshark sampler setup for sharper image details — listopalafoto · 2026-07-22
- Animation shows how an MLP’s first-layer weights change while learning MNIST — CatAstro_Piyush · 2026-07-22
- Project APE finds verifier reliability drops when papers contain multiple errors — soumitrashukla9 · 2026-07-22
- Project APE says verifier costs fell about 90x in a year as Chinese open models lead — soumitrashukla9 · 2026-07-22