SPRINT: A Unified Toolkit for Evaluating and Demystifying Zero-shot Neural Sparse Retrieval
Not on the map. Why?
Abstract (arXiv)
Traditionally, sparse retrieval systems relied on lexical representations to retrieve documents, such as BM25, dominated information retrieval tasks. With the onset of pre-trained transformer models such as BERT, neural sparse retrieval has led to a new paradigm within retrieval. Despite the success, there has been limited software supporting different sparse retrievers running in a unified, common environment. This hinders practitioners from fairly comparing different sparse models and obtaining realistic evaluation results. Another missing piece is, that a majority of prior work evaluates sparse retrieval models on in-domain retrieval, i.e. on a single dataset: MS MARCO. However, a key requirement in practical retrieval systems requires models that can generalize well to unseen out-of-domain, i.e. zero-shot retrieval tasks. In this work, we provide SPRINT, a unified Python toolkit based on Pyserini and Lucene, supporting a common interface for evaluating neural sparse retrieval. The toolkit currently includes five built-in models: uniCOIL, DeepImpact, SPARTA, TILDEv2 and SPLADEv2. Users can also easily add customized models by defining their term weighting method. Using our toolkit, we establish strong and reproducible zero-shot sparse retrieval baselines across the well-acknowledged benchmark, BEIR. Our results demonstrate that SPLADEv2 achieves the best average score of 0.470 nDCG@10 on BEIR amongst all neural sparse retrievers. In this work, we further uncover the reasons behind its performance gain. We show that SPLADEv2 produces sparse representations with a majority of tokens outside of the original query and document which is often crucial for its performance gains, i.e. a limitation among its other sparse counterparts. We provide our SPRINT toolkit, models, and data used in our experiments publicly here at https://github.com/thakur-nandan/sprint.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 37 of its 55 references that are in the map. First posted on arXiv 19 Jul 2023.
Builds on
37 of 55 references.
References · 37
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,591
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,225
- 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,153
- 2020Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrievalcited by 846
- 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 691
25 more
- 2020Fact or Fiction: Verifying Scientific Claimscited by 546
- 2020RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answeringcited by 410
- 2021SPLADE: Sparse Lexical and Expansion Model for First Stage Rankingcited by 283
- 2020Overview of the TREC 2019 deep learning trackcited by 282
- 2020Pretrained Transformers for Text Ranking: BERT and Beyondcited by 266
- 2021Efficiently Teaching an Effective Dense Retriever with Balanced Topic Aware Samplingcited by 238
- 2019Document Expansion by Query Predictioncited by 225
- 2020Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillationcited by 143
- 2021SPLADE v2: Sparse Lexical and Expansion Model for Information Retrievalcited by 126
- 2021COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted Listcited by 113
- 2021A Few Brief Notes on DeepImpact, COIL, and a Conceptual Framework for Information Retrieval Techniquescited by 69
- 2021Learning Passage Impacts for Inverted Indexescited by 68
- 2020SPARTA: Efficient Open-Domain Question Answering via Sparse Transformer Matching Retrievalcited by 50
- 2020Minimizing FLOPs to Learn Efficient Sparse Representationscited by 46
- 2020SparTerm: Learning Term-based Sparse Representation for Fast Text Retrievalcited by 45
- 2020Declarative Experimentation in Information Retrieval using PyTerriercited by 29
- 2022An Efficiency Study for SPLADE Modelscited by 26
- 2020Embedding-based Zero-shot Retrieval through Query Generationcited by 24
- 2021Fast Passage Re-ranking with Contextualized Exact Term Matching and Efficient Passage Expansioncited by 20
- 2023A Unified Framework for Learned Sparse Retrievalcited by 17
- 2021Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluationcited by 15
- 2020Flexible retrieval with NMSLIB and FlexNeuARTcited by 14
- 2023SLIM: Sparsified Late Interaction for Multi-Vector Retrieval with Inverted Indexescited by 12
- 2021Densifying Sparse Representations for Passage Retrieval by Representational Slicingcited by 6
- 2021Sparsifying Sparse Representations for Passage Retrieval by Top-k Maskingcited by 5
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.