PLAID
Authors:
Open Access
- 17 October 2022
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1747-1756
Abstract
Pre-trained language models are increasingly important components across multiple information retrieval (IR) paradigms. Late interaction, introduced with the ColBERT model and recently refined in ColBERTv2, is a popular paradigm that holds state-of-the-art status across many benchmarks. To dramatically speed up the search latency of late interaction, we introduce the Performance-optimized Late Interaction Driver (PLAID) engine. Without impacting quality, PLAID swiftly eliminates low-scoring passages using a novel centroid interaction mechanism that treats every passage as a lightweight bag of centroids. PLAID uses centroid interaction as well as centroid pruning, a mechanism for sparsifying the bag of centroids, within a highly-optimized engine to reduce late interaction search latency by up to 7x on a GPU and 45x on a CPU against vanilla ColBERTv2, while continuing to deliver state-of-the-art retrieval quality. This allows the PLAID engine with ColBERTv2 to achieve latency of tens of milliseconds on a GPU and tens or just few hundreds of milliseconds on a CPU at large scale, even at the largest scales we evaluate with 140M passages.Keywords
This publication has 23 references indexed in Scilit:
- CEDR2019
- Billion-Scale Similarity Search with GPUsIEEE Transactions on Big Data, 2019
- An Experimental Study of Index Compression and DAAT Query Processing Methods2019
- Faster BlockMax WAND with Longer Skipping2019
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search2019
- AnseriniJournal of Data and Information Quality, 2018
- Faster BlockMax WAND with Variable-sized Blocks2017
- Optimizing top-k document retrieval strategies for block-max indexes2013
- Faster top-k document retrieval using block-max indexes2011
- Efficient query evaluation using a two-level retrieval process2003