{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:30:26Z","timestamp":1774449026236,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,13]]},"DOI":"10.1145\/3726302.3729904","type":"proceedings-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T01:18:36Z","timestamp":1752455916000},"page":"2504-2512","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["WARP: An Efficient Engine for Multi-Vector Retrieval"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-8262-1654","authenticated-orcid":false,"given":"Jan Luca","family":"Scheerer","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7547-7204","authenticated-orcid":false,"given":"Matei","family":"Zaharia","sequence":"additional","affiliation":[{"name":"UC Berkeley, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7978-6055","authenticated-orcid":false,"given":"Christopher","family":"Potts","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4396-6695","authenticated-orcid":false,"given":"Gustavo","family":"Alonso","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9836-4413","authenticated-orcid":false,"given":"Omar","family":"Khattab","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Thibault Formal St\u00e9phane Clinchant Herv\u00e9 D\u00e9jean and Carlos Lassance. 2024. Splate: sparse late interaction retrieval. (2024). arXiv: 2404.13950 [cs.IR].","DOI":"10.1145\/3626772.3657968"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Luyu Gao Zhuyun Dai and Jamie Callan. 2021. Coil: revisit exact lexical match in information retrieval with contextualized inverted list. (2021). https:\/\/arxiv.org\/abs\/2104.07186 arXiv: 2104.07186 [cs.IR].","DOI":"10.18653\/v1\/2021.naacl-main.241"},{"key":"e_1_3_2_1_3_1","unstructured":"Stanford Future Data Systems Research Group. 2024. colbert-ir\/colbertv2.0. https:\/\/huggingface.co\/colbert-ir\/colbertv2.0. (2024)."},{"key":"e_1_3_2_1_4_1","unstructured":"Stanford Future Data Systems Research Group. 2024. ColBERTv2\/PLAID (Code). https:\/\/github.com\/stanford-futuredata\/ColBERT. (2024)."},{"key":"e_1_3_2_1_5_1","volume-title":"Accelerating large-scale inference with anisotropic vector quantization. (2020). https:\/\/arxiv.org\/abs\/1908.10396 arXiv","author":"Guo Ruiqi","year":"1908","unstructured":"Ruiqi Guo, Philip Sun, Erik Lindgren, Quan Geng, David Simcha, Felix Chern, and Sanjiv Kumar. 2020. Accelerating large-scale inference with anisotropic vector quantization. (2020). https:\/\/arxiv.org\/abs\/1908.10396 arXiv: 1908.10396 [cs.LG]."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Vladimir Karpukhin Barlas Oguz SewonMin Patrick Lewis LedellWu Sergey Edunov Danqi Chen and Wen-tau Yih. 2020. Dense passage retrieval for open domain question answering. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). Bonnie Webber Trevor Cohn Yulan He and Yang Liu (Eds.) Association for Computational Linguistics Online (Nov. 2020) 6769-6781. doi: 10.18653\/v1\/2020.emnlp-main.550.","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_8_1","volume-title":"Colbert: efficient and effective passage search via contextualized late interaction over BERT. CoRR, abs\/2004.12832. https:\/\/arxiv.org\/abs\/2004.12832 arXiv","author":"Khattab Omar","year":"2004","unstructured":"Omar Khattab and Matei Zaharia. 2020. Colbert: efficient and effective passage search via contextualized late interaction over BERT. CoRR, abs\/2004.12832. https:\/\/arxiv.org\/abs\/2004.12832 arXiv: 2004.12832."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2488217"},{"key":"e_1_3_2_1_10_1","volume-title":"Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Y. Zhao.","author":"Lee Jinhyuk","year":"2024","unstructured":"Jinhyuk Lee, Zhuyun Dai, Sai Meher Karthik Duddu, Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Y. Zhao. 2024. google\/xtr-base-en. https:\/\/huggingface.co\/google\/xtr-base-en. (2024)."},{"key":"e_1_3_2_1_11_1","volume-title":"Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Y. Zhao.","author":"Lee Jinhyuk","year":"2024","unstructured":"Jinhyuk Lee, Zhuyun Dai, Sai Meher Karthik Duddu, Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Y. Zhao. 2024. Rethinking the role of token retrieval in multi-vector retrieval. (2024). arXiv: 2304.01982 [cs.CL]."},{"key":"e_1_3_2_1_12_1","volume-title":"Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Y. Zhao.","author":"Lee Jinhyuk","year":"2024","unstructured":"Jinhyuk Lee, Zhuyun Dai, Sai Meher Karthik Duddu, Tao Lei, Iftekhar Naim, Ming-Wei Chang, and Vincent Y. Zhao. 2024. XTR: Rethinking the Role of Token Retrieval in Multi-Vector Retrieval (Code). https:\/\/github.com\/google-deepmind\/xtr. (2024)."},{"key":"e_1_3_2_1_13_1","unstructured":"Minghan Li Sheng-Chieh Lin Barlas Oguz Asish Ghoshal Jimmy Lin Yashar Mehdad Wen-tau Yih and Xilun Chen. 2022. Citadel: conditional token interaction via dynamic lexical routing for efficient and effective multi-vector retrieval. (2022). https:\/\/arxiv.org\/abs\/2211.10411 arXiv: 2211.10411 [cs.IR]."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Sean MacAvaney and Nicola Tonellotto. 2024. A reproducibility study of plaid. arXiv preprint arXiv:2404.14989.","DOI":"10.1145\/3626772.3657856"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Franco Maria Nardini Cosimo Rulli and Rossano Venturini. 2024. Efficient multi-vector dense retrieval using bit vectors. (2024). arXiv: 2404.02805 [cs.IR].","DOI":"10.1007\/978-3-031-56060-6_1"},{"key":"e_1_3_2_1_16_1","volume-title":"Liu","author":"Raffel Colin","year":"2023","unstructured":"Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou,Wei Li, and Peter J. Liu. 2023. Exploring the limits of transfer learning with a unified text-to-text transformer. (2023). https:\/\/arxiv.org\/abs\/1910.10683 arXiv: 1910.10683 [cs.LG]."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","unstructured":"Stephen Robertson and Hugo Zaragoza. 2009. The probabilistic relevance framework: bm25 and beyond. Foundations and Trends\u00ae in Information Retrieval 3 4 333-389. doi: 10.1561\/1500000019.","DOI":"10.1561\/1500000019"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Keshav Santhanam Omar Khattab Christopher Potts and Matei Zaharia. 2022. Plaid: an efficient engine for late interaction retrieval. (2022). arXiv: 2205.09707 [cs.IR].","DOI":"10.1145\/3511808.3557325"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Keshav Santhanam Omar Khattab Jon Saad-Falcon Christopher Potts and Matei Zaharia. 2021. Colbertv2: effective and efficient retrieval via lightweight late interaction. CoRR abs\/2112.01488. https:\/\/arxiv.org\/abs\/2112.01488 arXiv:2112.01488.","DOI":"10.18653\/v1\/2022.naacl-main.272"},{"key":"e_1_3_2_1_20_1","unstructured":"Nandan Thakur Nils Reimers Andreas R\u00fcckl\u00e9 Abhishek Srivastava and Iryna Gurevych. 2021. Beir: a heterogenous benchmark for zero-shot evaluation of information retrieval models. (2021). https:\/\/arxiv.org\/abs\/2104.08663 arXiv:2104.08663 [cs.IR]."},{"key":"e_1_3_2_1_21_1","volume-title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval. (2020). https:\/\/arxiv.org\/abs\/2007.00808 arXiv","author":"Xiong Lee","year":"2007","unstructured":"Lee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang, Jialin Liu, Paul Bennett, Junaid Ahmed, and Arnold Overwijk. 2020. Approximate nearest neighbor negative contrastive learning for dense text retrieval. (2020). https:\/\/arxiv.org\/abs\/2007.00808 arXiv: 2007.00808 [cs.IR]."},{"key":"e_1_3_2_1_22_1","unstructured":"Jingtao Zhan Jiaxin Mao Yiqun Liu Jiafeng Guo Min Zhang and Shaoping Ma. 2021. Optimizing dense retrieval model training with hard negatives. (2021). https:\/\/arxiv.org\/abs\/2104.08051 arXiv: 2104.08051 [cs.IR]."}],"event":{"name":"SIGIR '25: The 48th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Padua Italy","acronym":"SIGIR '25","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726302.3729904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T18:29:04Z","timestamp":1755887344000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726302.3729904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":22,"alternative-id":["10.1145\/3726302.3729904","10.1145\/3726302"],"URL":"https:\/\/doi.org\/10.1145\/3726302.3729904","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}