Pith. sign in

REVIEW 1 cited by

PLAID: An Efficient Engine for Late Interaction Retrieval

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09707 v1 pith:QZ4WHRMQ submitted 2022-05-19 cs.IR cs.CL

classification cs.IRcs.CL
keywords interactionlateplaidcentroidcolbertv2enginelatencyretrieval
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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). 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 7$\times$ on a GPU and 45$\times$ 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. WARP: An Efficient Engine for Multi-Vector Retrieval

    cs.IR 2025-01 conditional novelty 6.0 of 10

    WARP combines centroid-based compression, implicit decompression, and a new missing-similarity heuristic to make XTR-style multi-vector retrieval much faster with little quality loss.

Pith tools