mlsanityData to 14 Oct 2026

An Alternative to FLOPS Regularization to Effectively Productionize SPLADE-Doc

arXiv 2505.15070 ↗First posted 21 May 2025cs.IR cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Learned Sparse Retrieval (LSR) models encode text as weighted term vectors, which need to be sparse to leverage inverted index structures during retrieval. SPLADE, the most popular LSR model, uses FLOPS regularization to encourage vector sparsity during training. However, FLOPS regularization does not ensure sparsity among terms - only within a given query or document. Terms with very high Document Frequencies (DFs) substantially increase latency in production retrieval engines, such as Apache Solr, due to their lengthy posting lists. To address the issue of high DFs, we present a new variant of FLOPS regularization: DF-FLOPS. This new regularization technique penalizes the usage of high-DF terms, thereby shortening posting lists and reducing retrieval latency. Unlike other inference-time sparsification methods, such as stopword removal, DF-FLOPS regularization allows for the selective inclusion of high-frequency terms in cases where the terms are truly salient. We find that DF-FLOPS successfully reduces the prevalence of high-DF terms and lowers retrieval latency (around 10x faster) in a production-grade engine while maintaining effectiveness both in-domain (only a 2.2-point drop in MRR@10) and cross-domain (improved performance in 12 out of 13 tasks on which we tested). With retrieval latencies on par with BM25, this work provides an important step towards making LSR practical for deployment in production-grade search engines.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 15 of its 29 references that are in the map. First posted on arXiv 21 May 2025.

Builds on

15 of 29 references.

References · 15

  1. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
  2. 2020Overview of the TREC 2019 deep learning trackcited by 286
  3. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
  4. 2024SPLADE-v3: New baselines for SPLADEcited by 72
  5. 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
  6. 2021Learning Passage Impacts for Inverted Indexescited by 68
  7. 2020Minimizing FLOPs to Learn Efficient Sparse Representationscited by 46
  8. 2020Expansion via Prediction of Importance with Contextualizationcited by 26
  9. 2022An Efficiency Study for SPLADE Modelscited by 26
  10. 2024Efficient Inverted Indexes for Approximate Retrieval over Learned Sparse Representationscited by 24
  11. 2025Scaling Sparse and Dense Retrieval in Decoder-Only LLMscited by 12
  12. 2023A Static Pruning Study on Sparse Neural Retrieverscited by 11
3 more
  1. 2024Faster Learned Sparse Retrieval with Block-Max Pruningcited by 10
  2. 2024Pairing Clustered Inverted Indexes with kNN Graphs for Fast Approximate Retrieval over Learned Sparse Representationscited by 5
  3. 2023Representation Sparsification with Hybrid Thresholding for Fast SPLADE-based Document Retrievalcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 3.

3 papers.