mlsanityData to 14 Oct 2026

An Efficiency Study for SPLADE Models

arXiv 2207.03834 ↗First posted 8 Jul 2022cs.IR cs.CLcited by 26

Not on the map. Why?

Abstract (arXiv)

Latency and efficiency issues are often overlooked when evaluating IR models based on Pretrained Language Models (PLMs) in reason of multiple hardware and software testing scenarios. Nevertheless, efficiency is an important part of such systems and should not be overlooked. In this paper, we focus on improving the efficiency of the SPLADE model since it has achieved state-of-the-art zero-shot performance and competitive results on TREC collections. SPLADE efficiency can be controlled via a regularization factor, but solely controlling this regularization has been shown to not be efficient enough. In order to reduce the latency gap between SPLADE and traditional retrieval systems, we propose several techniques including L1 regularization for queries, a separation of document/query encoders, a FLOPS-regularized middle-training, and the use of faster query encoders. Our benchmark demonstrates that we can drastically improve the efficiency of these models while increasing the performance metrics on in-domain data. To our knowledge, we propose the first neural models that, under the same computing constraints, textitachieve similar latency (less than 4ms difference) as traditional BM25, while having textitsimilar performance (less than 10% MRR@10 reduction) as the state-of-the-art single-stage neural rankers on in-domain data.

Key facts. Cited by 26 papers in the map (data through 14 Oct 2026). Builds on 32 of its 57 references that are in the map. First posted on arXiv 8 Jul 2022.

Builds on

32 of 57 references.

References · 32

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2017Billion-scale similarity search with GPUscited by 2,497
  4. 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
  5. 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
  6. 2021Unsupervised Dense Information Retrieval with Contrastive Learningcited by 1,216
  7. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
  8. 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 849
  9. 2019Passage Re-ranking with BERTcited by 645
  10. 2021ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interactioncited by 476
  11. 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 413
  12. 2022Text and Code Embeddings by Contrastive Pre-Trainingcited by 361
20 more
  1. 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 286
  2. 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
  3. 2019Document Expansion by Query Predictioncited by 231
  4. 2022SGPT: GPT Sentence Embeddings for Semantic Searchcited by 204
  5. 2021Unsupervised Corpus Aware Language Model Pre-training for Dense Passage Retrievalcited by 203
  6. 2021Overview of the TREC 2020 deep learning trackcited by 196
  7. 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 145
  8. 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 127
  9. 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
  10. 2022PLAID: An Efficient Engine for Late Interaction Retrievalcited by 101
  11. 2021Learning Passage Impacts for Inverted Indexescited by 68
  12. 2021Generalization in NLI: Ways (Not) To Go Beyond Simple Heuristicscited by 67
  13. 2019Context-Aware Sentence/Passage Term Importance Estimation For First Stage Retrievalcited by 65
  14. 2020SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrievalcited by 50
  15. 2020Minimizing FLOPs to Learn Efficient Sparse Representationscited by 46
  16. 2020SparTerm: Learning Term-based Sparse Representation for Fast Text Retrievalcited by 45
  17. 2022LaPraDoR: Unsupervised Pretrained Dense Retriever for Zero-Shot Text Retrievalcited by 24
  18. 2021Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansioncited by 20
  19. 2021Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluationcited by 15
  20. 2019Let's measure run time! Extending the IR replicability infrastructure to include performance aspectscited by 10

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 7; 2024: 5; 2025: 8; 2026: 5.

26 papers.

Sort:

By area:

  1. 2024SPLADE-v3: New baselines for SPLADEcited by 72
  2. 2023NevIR: Negation in Neural Information Retrievalcited by 29
  3. 2023STAIR: Learning Sparse Text and Image Representation in Grounded Tokenscited by 23
  4. 2024Benchmarking and Building Long-Context Retrieval Models with LoCo and M2-BERTcited by 21
  5. 2025Efficient Constant-Space Multi-Vector Retrievalcited by 12
  6. 2024DiSCo: LLM Knowledge Distillation for Efficient Sparse Retrieval in Conversational Searchcited by 9
  7. 2024Towards Competitive Search Relevance For Inference-Free Learned Sparse Retrieverscited by 8
  8. 2026LACONIC: Dense-Level Effectiveness for Scalable Sparse Retrieval via a Two-Phase Training Curriculumcited by 5
  9. 2022Moving Beyond Downstream Task Accuracy for Information Retrieval Benchmarkingcited by 4
  10. 2025The Role of Vocabularies in Learning Sparse Representations for Rankingcited by 4
  11. 2023An Experimental Study on Pretraining Transformers from Scratch for IRcited by 3
  12. 2023Parameter-Efficient Sparse Retrievers and Rerankers using Adapterscited by 3
14 more
  1. 2025An Alternative to FLOPS Regularization to Effectively Productionize SPLADE-Doccited by 3
  2. 2023NAIL: Lexical Retrieval Indices with Efficient Non-Autoregressive Decoderscited by 2
  3. 2023SPRINT: A Unified Toolkit for Evaluating and Demystifying Zero-shot Neural Sparse Retrievalcited by 2
  4. 2025K-COMP: Retrieval-Augmented Medical Domain Question Answering With Knowledge-Injected Compressorcited by 2
  5. 2025SINDI: An Efficient Index for Sparse Vector Approximate Maximum Inner Product Searchcited by 2
  6. 2026On the Challenges and Opportunities of Learned Sparse Retrieval for Codecited by 2
  7. 2023LexLIP: Lexicon-Bottlenecked Language-Image Pre-Training for Large-Scale Image-Text Retrievalcited by 1
  8. 2024Unifying Latent and Lexicon Representations for Effective Video-Text Retrievalcited by 1
  9. 2025Exploring ℓ0 Sparsification for Inference-free Sparse Retrieverscited by 1
  10. 2025Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Setscited by 1
  11. 2025Efficiency and Effectiveness of SPLADE Models on Billion-Scale Web Document Titlecited by 1
  12. 2026Evaluation of Agents under Simulated AI Marketplace Dynamicscited by 1
  13. 2026Latent Terms: Dense Retrievers Contain Trivially Extractable BM25-ready Zipfian Vocabulariescited by 0
  14. 2026Why Advanced Encoders Lag on Sparse Retrieval? The Answer and an Approach to Bridging Vocabulary Gapscited by 0