Efficient Splade VI BT Large Query

🚀 Efficient SPLADE

An efficient SPLADE model designed for passage retrieval, featuring separate models for query and document inference.

🚀 Quick Start

The Efficient SPLADE model is crafted for passage retrieval. This architecture employs two distinct models for query and document inference. This is the query model. You should also download the doc model from here. For more details, refer to:

• Paper: https://dl.acm.org/doi/10.1145/3477495.3531833
• Code: https://github.com/naver/splade

📚 Documentation

Tags

• splade
• query-expansion
• document-expansion
• bag-of-words
• passage-retrieval
• knowledge-distillation
• document encoder

Datasets

• ms_marco

📄 License

This project is licensed under the CC BY-NC-SA 4.0 license.

📚 Citation

If you use our checkpoint, please cite our work:

@inproceedings{10.1145/3477495.3531833,
author = {Lassance, Carlos and Clinchant, St\'{e}phane},
title = {An Efficiency Study for SPLADE Models},
year = {2022},
isbn = {9781450387323},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3477495.3531833},
doi = {10.1145/3477495.3531833},
abstract = {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, achieve similar latency (less than 4ms difference) as traditional BM25, while having similar performance (less than 10% MRR@10 reduction) as the state-of-the-art single-stage neural rankers on in-domain data.},
booktitle = {Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval},
pages = {2220–2226},
numpages = {7},
keywords = {splade, latency, information retrieval, sparse representations},
location = {Madrid, Spain},
series = {SIGIR '22}
}