{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:30:31Z","timestamp":1774449031321,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T00:00:00Z","timestamp":1665964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,17]]},"DOI":"10.1145\/3511808.3557325","type":"proceedings-article","created":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T01:22:22Z","timestamp":1665883342000},"page":"1747-1756","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["PLAID"],"prefix":"10.1145","author":[{"given":"Keshav","family":"Santhanam","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Omar","family":"Khattab","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Christopher","family":"Potts","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Matei","family":"Zaharia","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00114"},{"key":"e_1_3_2_1_2_1","unstructured":"Anserini GitHub Repo Authors. 2021. Passage Collection (Augmented). https:\/\/github.com\/castorini\/anserini\/blob\/master\/docs\/experiments-msmarco-v2.md#passage-collection-augmented Anserini GitHub Repo Authors. 2021. Passage Collection (Augmented). https:\/\/github.com\/castorini\/anserini\/blob\/master\/docs\/experiments-msmarco-v2.md#passage-collection-augmented"},{"key":"e_1_3_2_1_3_1","volume-title":"Anserini Regressions: MS MARCO (V2) Passage Ranking. https:\/\/github.com\/castorini\/anserini\/blob\/master\/docs\/regressions-msmarco-v2-passage-augmented.md","author":"GitHub Repo Authors Anserini","year":"2022","unstructured":"Anserini GitHub Repo Authors . 2022 . Anserini Regressions: MS MARCO (V2) Passage Ranking. https:\/\/github.com\/castorini\/anserini\/blob\/master\/docs\/regressions-msmarco-v2-passage-augmented.md Anserini GitHub Repo Authors. 2022. Anserini Regressions: MS MARCO (V2) Passage Ranking. https:\/\/github.com\/castorini\/anserini\/blob\/master\/docs\/regressions-msmarco-v2-passage-augmented.md"},{"key":"e_1_3_2_1_4_1","unstructured":"Jo Kristian Bergum. 2021. Pretrained Transformer Language Models for Search - part 3. https:\/\/blog.vespa.ai\/pretrained-transformer-language-models-for-search-part-3\/ Jo Kristian Bergum. 2021. Pretrained Transformer Language Models for Search - part 3. https:\/\/blog.vespa.ai\/pretrained-transformer-language-models-for-search-part-3\/"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Andrei Z Broder David Carmel Michael Herscovici Aya Soffer and Jason Zien. 2003. Efficient query evaluation using a two-level retrieval process. In CIKM. Andrei Z Broder David Carmel Michael Herscovici Aya Soffer and Jason Zien. 2003. Efficient query evaluation using a two-level retrieval process. In CIKM.","DOI":"10.1145\/956863.956944"},{"key":"e_1_3_2_1_6_1","volume-title":"Overview of the TREC 2021 deep learning track. In Text REtrieval Conference (TREC). TREC. https:\/\/www.microsoft.com\/en-us\/research\/publication\/overview-of-the-trec-2021-deep-learning-track\/","author":"Craswell Nick","year":"2022","unstructured":"Nick Craswell , Bhaskar Mitra , Emine Yilmaz , Daniel Campos , and Jimmy Lin . 2022 . Overview of the TREC 2021 deep learning track. In Text REtrieval Conference (TREC). TREC. https:\/\/www.microsoft.com\/en-us\/research\/publication\/overview-of-the-trec-2021-deep-learning-track\/ Nick Craswell, Bhaskar Mitra, Emine Yilmaz, Daniel Campos, and Jimmy Lin. 2022. Overview of the TREC 2021 deep learning track. In Text REtrieval Conference (TREC). TREC. https:\/\/www.microsoft.com\/en-us\/research\/publication\/overview-of-the-trec-2021-deep-learning-track\/"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401204"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Constantinos Dimopoulos Sergey Nepomnyachiy and Torsten Suel. 2013. Optimizing top-k document retrieval strategies for block-max indexes. In WSDM. Constantinos Dimopoulos Sergey Nepomnyachiy and Torsten Suel. 2013. Optimizing top-k document retrieval strategies for block-max indexes. In WSDM.","DOI":"10.1145\/2433396.2433412"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Shuai Ding and Torsten Suel. 2011. Faster top-k document retrieval using block-max indexes. In SIGIR. Shuai Ding and Torsten Suel. 2011. Faster top-k document retrieval using block-max indexes. In SIGIR.","DOI":"10.1145\/2009916.2010048"},{"key":"e_1_3_2_1_10_1","volume-title":"SPLADE v2: Sparse Lexical and Expansion Model for Information Retrieval. arXiv preprint arXiv:2109.10086","author":"Formal Thibault","year":"2021","unstructured":"Thibault Formal , Carlos Lassance , Benjamin Piwowarski , and St\u00e9phane Clinchant . 2021a. SPLADE v2: Sparse Lexical and Expansion Model for Information Retrieval. arXiv preprint arXiv:2109.10086 ( 2021 ). https:\/\/arxiv.org\/abs\/2109.10086 Thibault Formal, Carlos Lassance, Benjamin Piwowarski, and St\u00e9phane Clinchant. 2021a. SPLADE v2: Sparse Lexical and Expansion Model for Information Retrieval. arXiv preprint arXiv:2109.10086 (2021). https:\/\/arxiv.org\/abs\/2109.10086"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463098"},{"key":"e_1_3_2_1_12_1","volume-title":"COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List. In Proceedings of the 2021 Conference of the North American","author":"Gao Luyu","year":"2021","unstructured":"Luyu Gao , Zhuyun Dai , and Jamie Callan . 2021 . COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics , Online , 3030--3042. https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.241 10.18653\/v1 Luyu Gao, Zhuyun Dai, and Jamie Callan. 2021. COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics, Online, 3030--3042. https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.241"},{"key":"e_1_3_2_1_13_1","volume-title":"Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation. arXiv preprint arXiv:2010.02666","author":"Hofst\u00e4tter Sebastian","year":"2020","unstructured":"Sebastian Hofst\u00e4tter , Sophia Althammer , Michael Schr\u00f6der , Mete Sertkan , and Allan Hanbury . 2020. Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation. arXiv preprint arXiv:2010.02666 ( 2020 ). https:\/\/arxiv.org\/abs\/2010.02666 Sebastian Hofst\u00e4tter, Sophia Althammer, Michael Schr\u00f6der, Mete Sertkan, and Allan Hanbury. 2020. Improving Efficient Neural Ranking Models with Cross-Architecture Knowledge Distillation. arXiv preprint arXiv:2010.02666 (2020). https:\/\/arxiv.org\/abs\/2010.02666"},{"key":"e_1_3_2_1_14_1","volume-title":"Introducing Neural Bag of Whole-Words with ColBERTer: Contextualized Late Interactions using Enhanced ReductionarXiv preprint arXiv:2203.13088","author":"Hofst\u00e4tter Sebastian","year":"2022","unstructured":"Sebastian Hofst\u00e4tter , Omar Khattab , Sophia Althammer , Mete Sertkan , and Allan Hanbury . 2022. Introducing Neural Bag of Whole-Words with ColBERTer: Contextualized Late Interactions using Enhanced ReductionarXiv preprint arXiv:2203.13088 ( 2022 ). Sebastian Hofst\u00e4tter, Omar Khattab, Sophia Althammer, Mete Sertkan, and Allan Hanbury. 2022. Introducing Neural Bag of Whole-Words with ColBERTer: Contextualized Late Interactions using Enhanced ReductionarXiv preprint arXiv:2203.13088 (2022)."},{"key":"e_1_3_2_1_15_1","volume-title":"Poly-encoders: Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoring. In 8th International Conference on Learning Representations, ICLR 2020","author":"Humeau Samuel","year":"2020","unstructured":"Samuel Humeau , Kurt Shuster , Marie-Anne Lachaux , and Jason Weston . 2020 . Poly-encoders: Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoring. In 8th International Conference on Learning Representations, ICLR 2020 , Addis Ababa, Ethiopia, April 26--30 , 2020. OpenReview.net. https:\/\/openreview.net\/forum?id=SkxgnnNFvH Samuel Humeau, Kurt Shuster, Marie-Anne Lachaux, and Jason Weston. 2020. Poly-encoders: Architectures and Pre-training Strategies for Fast and Accurate Multi-sentence Scoring. In 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26--30, 2020. OpenReview.net. https:\/\/openreview.net\/forum?id=SkxgnnNFvH"},{"key":"e_1_3_2_1_16_1","volume-title":"Product quantization for nearest neighbor search","author":"Jegou Herve","year":"2010","unstructured":"Herve Jegou , Matthijs Douze , and Cordelia Schmid . 2010. Product quantization for nearest neighbor search . IEEE transactions on pattern analysis and machine intelligence, Vol. 33 , 1 ( 2010 ), 117--128. Herve Jegou, Matthijs Douze, and Cordelia Schmid. 2010. Product quantization for nearest neighbor search. IEEE transactions on pattern analysis and machine intelligence, Vol. 33, 1 (2010), 117--128."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401076"},{"key":"e_1_3_2_1_20_1","volume-title":"Thirty-Fifth Conference on Neural Information Processing Systems.","author":"Khattab Omar","year":"2021","unstructured":"Omar Khattab , Christopher Potts , and Matei Zaharia . 2021 a. Baleen: Robust Multi-Hop Reasoning at Scale via Condensed Retrieval . In Thirty-Fifth Conference on Neural Information Processing Systems. Omar Khattab, Christopher Potts, and Matei Zaharia. 2021a. Baleen: Robust Multi-Hop Reasoning at Scale via Condensed Retrieval. In Thirty-Fifth Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00405"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401075"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1162\/tacl_a_00276"},{"key":"e_1_3_2_1_24_1","volume-title":"Bhavani Iyer, Young-Suk Lee, and Avirup Sil.","author":"Li Yulong","year":"2021","unstructured":"Yulong Li , Martin Franz , Md Arafat Sultan , Bhavani Iyer, Young-Suk Lee, and Avirup Sil. 2021 . Learning Cross-Lingual IR from an English Retriever . arXiv preprint arXiv:2112.08185 (2021). Yulong Li, Martin Franz, Md Arafat Sultan, Bhavani Iyer, Young-Suk Lee, and Avirup Sil. 2021. Learning Cross-Lingual IR from an English Retriever. arXiv preprint arXiv:2112.08185 (2021)."},{"key":"e_1_3_2_1_25_1","volume-title":"ACM SIGIR Forum","volume":"55","author":"Lin Jimmy","year":"2022","unstructured":"Jimmy Lin . 2022 . A proposed conceptual framework for a representational approach to information retrieval . In ACM SIGIR Forum , Vol. 55 . ACM New York, NY, USA, 1--29. Jimmy Lin. 2022. A proposed conceptual framework for a representational approach to information retrieval. In ACM SIGIR Forum, Vol. 55. ACM New York, NY, USA, 1--29."},{"key":"e_1_3_2_1_26_1","volume-title":"Toward A Fine-Grained Analysis of Distribution Shifts in MSMARCO. arXiv preprint arXiv:2205.02870","author":"Lupart Simon","year":"2022","unstructured":"Simon Lupart and St\u00e9phane Clinchant . 2022. Toward A Fine-Grained Analysis of Distribution Shifts in MSMARCO. arXiv preprint arXiv:2205.02870 ( 2022 ). Simon Lupart and St\u00e9phane Clinchant. 2022. Toward A Fine-Grained Analysis of Distribution Shifts in MSMARCO. arXiv preprint arXiv:2205.02870 (2022)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331317"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482156"},{"key":"e_1_3_2_1_29_1","volume-title":"On Single and Multiple Representations in Dense Passage Retrieval. arXiv preprint arXiv:2108.06279","author":"Macdonald Craig","year":"2021","unstructured":"Craig Macdonald , Nicola Tonellotto , and Iadh Ounis . 2021. On Single and Multiple Representations in Dense Passage Retrieval. arXiv preprint arXiv:2108.06279 ( 2021 ). Craig Macdonald, Nicola Tonellotto, and Iadh Ounis. 2021. On Single and Multiple Representations in Dense Passage Retrieval. arXiv preprint arXiv:2108.06279 (2021)."},{"key":"e_1_3_2_1_30_1","volume-title":"Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation. arXiv preprint arXiv:2110.11540","author":"Mackenzie Joel","year":"2021","unstructured":"Joel Mackenzie , Andrew Trotman , and Jimmy Lin . 2021. Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation. arXiv preprint arXiv:2110.11540 ( 2021 ). Joel Mackenzie, Andrew Trotman, and Jimmy Lin. 2021. Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation. arXiv preprint arXiv:2110.11540 (2021)."},{"key":"e_1_3_2_1_31_1","volume-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"Malkov Yu A","year":"2018","unstructured":"Yu A Malkov and Dmitry A Yashunin . 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs . IEEE transactions on pattern analysis and machine intelligence, Vol. 42 , 4 ( 2018 ), 824--836. Yu A Malkov and Dmitry A Yashunin. 2018. Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE transactions on pattern analysis and machine intelligence, Vol. 42, 4 (2018), 824--836."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3463030"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Antonio Mallia Giuseppe Ottaviano Elia Porciani Nicola Tonellotto and Rossano Venturini. 2017. Faster blockmax wand with variable-sized blocks. In SIGIR. Antonio Mallia Giuseppe Ottaviano Elia Porciani Nicola Tonellotto and Rossano Venturini. 2017. Faster blockmax wand with variable-sized blocks. In SIGIR.","DOI":"10.1145\/3077136.3080780"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_52"},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the Open-Source IR Replicability Challenge","author":"Mallia Antonio","year":"2019","unstructured":"Antonio Mallia , Michal Siedlaczek , Joel Mackenzie , and Torsten Suel . 2019 b. PISA: Performant indexes and search for academia . Proceedings of the Open-Source IR Replicability Challenge (2019). Antonio Mallia, Michal Siedlaczek, Joel Mackenzie, and Torsten Suel. 2019b. PISA: Performant indexes and search for academia. Proceedings of the Open-Source IR Replicability Challenge (2019)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_23"},{"key":"e_1_3_2_1_37_1","volume-title":"Zero-shot Query Contextualization for Conversational Search. arXiv e-prints","author":"Krasakis Antonios Minas","year":"2022","unstructured":"Antonios Minas Krasakis , Andrew Yates , and Evangelos Kanoulas . 2022. Zero-shot Query Contextualization for Conversational Search. arXiv e-prints ( 2022 ), arXiv--2204. Antonios Minas Krasakis, Andrew Yates, and Evangelos Kanoulas. 2022. Zero-shot Query Contextualization for Conversational Search. arXiv e-prints (2022), arXiv--2204."},{"key":"e_1_3_2_1_38_1","volume-title":"MS MARCO: A Human-Generated MAchine Reading COmprehension Dataset. arXiv preprint arXiv:1611.09268","author":"Nguyen Tri","year":"2016","unstructured":"Tri Nguyen , Mir Rosenberg , Xia Song , Jianfeng Gao , Saurabh Tiwary , Rangan Majumder , and Li Deng . 2016 . MS MARCO: A Human-Generated MAchine Reading COmprehension Dataset. arXiv preprint arXiv:1611.09268 (2016). https:\/\/arxiv.org\/abs\/1611.09268 Tri Nguyen, Mir Rosenberg, Xia Song, Jianfeng Gao, Saurabh Tiwary, Rangan Majumder, and Li Deng. 2016. MS MARCO: A Human-Generated MAchine Reading COmprehension Dataset. arXiv preprint arXiv:1611.09268 (2016). https:\/\/arxiv.org\/abs\/1611.09268"},{"key":"e_1_3_2_1_39_1","volume-title":"Passage Re-ranking with BERT. arXiv preprint arXiv:1901.04085","author":"Nogueira Rodrigo","year":"2019","unstructured":"Rodrigo Nogueira and Kyunghyun Cho . 2019. Passage Re-ranking with BERT. arXiv preprint arXiv:1901.04085 ( 2019 ). https:\/\/arxiv.org\/abs\/1901.04085 Rodrigo Nogueira and Kyunghyun Cho. 2019. Passage Re-ranking with BERT. arXiv preprint arXiv:1901.04085 (2019). https:\/\/arxiv.org\/abs\/1901.04085"},{"key":"e_1_3_2_1_40_1","volume-title":"Hindsight: Posterior-guided Training of Retrievers for Improved Open-ended Generation. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Vr_BTpw3wz","author":"Paranjape Ashwin","year":"2022","unstructured":"Ashwin Paranjape , Omar Khattab , Christopher Potts , Matei Zaharia , and Christopher D Manning . 2022 . Hindsight: Posterior-guided Training of Retrievers for Improved Open-ended Generation. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Vr_BTpw3wz Ashwin Paranjape, Omar Khattab, Christopher Potts, Matei Zaharia, and Christopher D Manning. 2022. Hindsight: Posterior-guided Training of Retrievers for Improved Open-ended Generation. In International Conference on Learning Representations. https:\/\/openreview.net\/forum?id=Vr_BTpw3wz"},{"key":"e_1_3_2_1_41_1","volume-title":"Daxiang Dong, Hua Wu, and Haifeng Wang.","author":"Qu Yingqi","year":"2021","unstructured":"Yingqi Qu , Yuchen Ding , Jing Liu , Kai Liu , Ruiyang Ren , Wayne Xin Zhao , Daxiang Dong, Hua Wu, and Haifeng Wang. 2021 . RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics , Online, 5835--5847. https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.466 10.18653\/v1 Yingqi Qu, Yuchen Ding, Jing Liu, Kai Liu, Ruiyang Ren, Wayne Xin Zhao, Daxiang Dong, Hua Wu, and Haifeng Wang. 2021. RocketQA: An Optimized Training Approach to Dense Passage Retrieval for Open-Domain Question Answering. In Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. Association for Computational Linguistics, Online, 5835--5847. https:\/\/doi.org\/10.18653\/v1\/2021.naacl-main.466"},{"key":"e_1_3_2_1_42_1","volume-title":"Qiaoqiao She, Hua Wu, Haifeng Wang, and Ji-Rong Wen.","author":"Ren Ruiyang","year":"2021","unstructured":"Ruiyang Ren , Yingqi Qu , Jing Liu , Wayne Xin Zhao , Qiaoqiao She, Hua Wu, Haifeng Wang, and Ji-Rong Wen. 2021 . RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking . arXiv preprint arXiv:2110.07367 (2021). https:\/\/arxiv.org\/abs\/2110.07367 Ruiyang Ren, Yingqi Qu, Jing Liu, Wayne Xin Zhao, Qiaoqiao She, Hua Wu, Haifeng Wang, and Ji-Rong Wen. 2021. RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking. arXiv preprint arXiv:2110.07367 (2021). https:\/\/arxiv.org\/abs\/2110.07367"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Stephen E Robertson Steve Walker Susan Jones Micheline M Hancock-Beaulieu Mike Gatford etal 1995. Okapi at TREC-3. NIST Special Publication (1995). Stephen E Robertson Steve Walker Susan Jones Micheline M Hancock-Beaulieu Mike Gatford et al. 1995. Okapi at TREC-3. NIST Special Publication (1995).","DOI":"10.6028\/NIST.SP.500-225.routing-city"},{"key":"e_1_3_2_1_44_1","volume-title":"ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. arXiv preprint arXiv:2112.01488","author":"Santhanam Keshav","year":"2021","unstructured":"Keshav Santhanam , Omar Khattab , Jon Saad-Falcon , Christopher Potts , and Matei Zaharia . 2021. ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. arXiv preprint arXiv:2112.01488 ( 2021 ). Keshav Santhanam, Omar Khattab, Jon Saad-Falcon, Christopher Potts, and Matei Zaharia. 2021. ColBERTv2: Effective and Efficient Retrieval via Lightweight Late Interaction. arXiv preprint arXiv:2112.01488 (2021)."},{"key":"e_1_3_2_1_45_1","volume-title":"RELIC: Retrieving Evidence for Literary Claims. arXiv preprint arXiv:2203.10053","author":"Thai Katherine","year":"2022","unstructured":"Katherine Thai , Yapei Chang , Kalpesh Krishna , and Mohit Iyyer . 2022 . RELIC: Retrieving Evidence for Literary Claims. arXiv preprint arXiv:2203.10053 (2022). Katherine Thai, Yapei Chang, Kalpesh Krishna, and Mohit Iyyer. 2022. RELIC: Retrieving Evidence for Literary Claims. arXiv preprint arXiv:2203.10053 (2022)."},{"key":"e_1_3_2_1_46_1","unstructured":"Nandan Thakur Nils Reimers Andreas R\u00fcckl\u00e9 Abhishek Srivastava and Iryna Gurevych. 2021. BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2). https:\/\/openreview.net\/forum?id=wCu6T5xFjeJ Nandan Thakur Nils Reimers Andreas R\u00fcckl\u00e9 Abhishek Srivastava and Iryna Gurevych. 2021. BEIR: A Heterogeneous Benchmark for Zero-shot Evaluation of Information Retrieval Models. In Thirty-fifth Conference on Neural Information Processing Systems Datasets and Benchmarks Track (Round 2). https:\/\/openreview.net\/forum?id=wCu6T5xFjeJ"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482162"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Nicola Tonellotto Craig Macdonald Iadh Ounis etal 2018. Efficient Query Processing for Scalable Web Search. Foundations and Trends\u00ae in Information Retrieval (2018). Nicola Tonellotto Craig Macdonald Iadh Ounis et al. 2018. Efficient Query Processing for Scalable Web Search. Foundations and Trends\u00ae in Information Retrieval (2018).","DOI":"10.1561\/9781680835434"},{"key":"e_1_3_2_1_49_1","volume-title":"Query evaluation: strategies and optimizations. IP & M","author":"Turtle Howard","year":"1995","unstructured":"Howard Turtle and James Flood . 1995. Query evaluation: strategies and optimizations. IP & M ( 1995 ). Howard Turtle and James Flood. 1995. Query evaluation: strategies and optimizations. IP & M (1995)."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471158.3472250"},{"key":"e_1_3_2_1_51_1","volume-title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In International Conference on Learning Representations.","author":"Xiong Lee","year":"2020","unstructured":"Lee Xiong , Chenyan Xiong , Ye Li , Kwok-Fung Tang , Jialin Liu , Paul N Bennett , Junaid Ahmed , and Arnold Overwijk . 2020 . Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In International Conference on Learning Representations. Lee Xiong, Chenyan Xiong, Ye Li, Kwok-Fung Tang, Jialin Liu, Paul N Bennett, Junaid Ahmed, and Arnold Overwijk. 2020. Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3239571"},{"key":"e_1_3_2_1_53_1","volume-title":"Curriculum Learning for Dense Retrieval Distillation. arXiv preprint arXiv:2204.13679","author":"Zeng Hansi","year":"2022","unstructured":"Hansi Zeng , Hamed Zamani , and Vishwa Vinay . 2022. Curriculum Learning for Dense Retrieval Distillation. arXiv preprint arXiv:2204.13679 ( 2022 ). Hansi Zeng, Hamed Zamani, and Vishwa Vinay. 2022. Curriculum Learning for Dense Retrieval Distillation. arXiv preprint arXiv:2204.13679 (2022)."},{"key":"e_1_3_2_1_54_1","volume-title":"Learning To Retrieve: How to Train a Dense Retrieval Model Effectively and Efficiently. arXiv preprint arXiv:2010.10469","author":"Zhan Jingtao","year":"2020","unstructured":"Jingtao Zhan , Jiaxin Mao , Yiqun Liu , Min Zhang , and Shaoping Ma. 2020. Learning To Retrieve: How to Train a Dense Retrieval Model Effectively and Efficiently. arXiv preprint arXiv:2010.10469 ( 2020 ). https:\/\/arxiv.org\/abs\/2010.10469 Jingtao Zhan, Jiaxin Mao, Yiqun Liu, Min Zhang, and Shaoping Ma. 2020. Learning To Retrieve: How to Train a Dense Retrieval Model Effectively and Efficiently. arXiv preprint arXiv:2010.10469 (2020). https:\/\/arxiv.org\/abs\/2010.10469"},{"key":"e_1_3_2_1_55_1","volume-title":"Evaluating Extrapolation Performance of Dense Retrieval. arXiv preprint arXiv:2204.11447","author":"Zhan Jingtao","year":"2022","unstructured":"Jingtao Zhan , Xiaohui Xie , Jiaxin Mao , Yiqun Liu , Min Zhang , and Shaoping Ma. 2022. Evaluating Extrapolation Performance of Dense Retrieval. arXiv preprint arXiv:2204.11447 ( 2022 ). Jingtao Zhan, Xiaohui Xie, Jiaxin Mao, Yiqun Liu, Min Zhang, and Shaoping Ma. 2022. Evaluating Extrapolation Performance of Dense Retrieval. arXiv preprint arXiv:2204.11447 (2022)."},{"key":"e_1_3_2_1_56_1","volume-title":"Evaluating Token-Level and Passage-Level Dense Retrieval Models for Math Information Retrieval. arXiv preprint arXiv:2203.11163","author":"Zhong Wei","year":"2022","unstructured":"Wei Zhong , Jheng-Hong Yang , and Jimmy Lin . 2022. Evaluating Token-Level and Passage-Level Dense Retrieval Models for Math Information Retrieval. arXiv preprint arXiv:2203.11163 ( 2022 ). Wei Zhong, Jheng-Hong Yang, and Jimmy Lin. 2022. Evaluating Token-Level and Passage-Level Dense Retrieval Models for Math Information Retrieval. arXiv preprint arXiv:2203.11163 (2022)."}],"event":{"name":"CIKM '22: The 31st ACM International Conference on Information and Knowledge Management","location":"Atlanta GA USA","acronym":"CIKM '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 31st ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3511808.3557325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:29Z","timestamp":1750182569000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3511808.3557325"}},"subtitle":["An Efficient Engine for Late Interaction Retrieval"],"short-title":[],"issued":{"date-parts":[[2022,10,17]]},"references-count":56,"alternative-id":["10.1145\/3511808.3557325","10.1145\/3511808"],"URL":"https:\/\/doi.org\/10.1145\/3511808.3557325","relation":{},"subject":[],"published":{"date-parts":[[2022,10,17]]},"assertion":[{"value":"2022-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}