Papers › PLAID: An Efficient Engine for Late Interaction Retrieval

PLAID: An Efficient Engine for Late Interaction Retrieval

19 May 2022arXiv:2205.09707archive 2025-07-28

Keshav Santhanam, Omar Khattab, Christopher Potts, Matei Zaharia

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× on a GPU and 45× 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.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 12 code samples harvested from 2 repositories linked to this paper: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 2 samples from 1 repository, 1 ran (1 with no instrument failure; 0 where Syntology's instrument failed); community (archive-listed): 10 samples from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-24 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

stanford-futuredata/ColBERT officialmentioned in papermentioned on GitHubpytorchMITSyntology: 2 samples, 1 ran (0 instrument-failed) · 1 unverified report
lightonai/pylate mentioned on GitHubpytorchMITSyntology: 10 samples, 0 ran · 10 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

12 samples harvested: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 11 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran
11unverified

Licence: 0 of the 12 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

stanford-futuredata/ColBERT official repository 2 samples, 1 ran (0 instrument-failed) · 1 unverified
pool_embeddings_hierarchical colbert/modeling/checkpoint.py ran MIT (permissive) · 94647c3b01781c9d · report fixture: signature p_embeddings:Tensor/2/float, token_lengths:list/1/int, pool_factor:int/0/int, protected_tokens:int/0/int, showprogress:bool/0/bool · returned tuple · level recorded 2026-09-24
find_class_names colbert/modeling/hf_colbert.py unverified MIT (permissive) · 92f33f7543114633 · report
lightonai/pylate community (archive-listed) 10 samples, 0 ran · 10 unverified
colbert_kd_scores pylate/scores/colbert.py unverified MIT (permissive) · 1ebe0cfae0199d86 · report
colbert_kd_scores_flash pylate/scores/_flash_backend.py unverified MIT (permissive) · 224990e9b3f9ef65 · report
colbert_kd_scores_lik pylate/scores/_lik_backend.py unverified MIT (permissive) · c92e9e137a01d1ae · report
colbert_scores pylate/scores/colbert.py unverified MIT (permissive) · a91e1fd19b4e7554 · report
colbert_scores_flash pylate/scores/_flash_backend.py unverified MIT (permissive) · 2d0901aeb6f8d0f2 · report
colbert_scores_lik pylate/scores/_lik_backend.py unverified MIT (permissive) · 45019a2cb403e497 · report
colbert_scores_pairwise pylate/scores/colbert.py unverified MIT (permissive) · 25c15dd2b88dd6a3 · report
colbert_scores_pairwise_flash pylate/scores/_flash_backend.py unverified MIT (permissive) · 118934c70d50bc00 · report
colbert_scores_pairwise_lik pylate/scores/_lik_backend.py unverified MIT (permissive) · 172113c1696193c3 · report
extract_skiplist_mask pylate/losses/contrastive.py unverified MIT (permissive) · 097db9fa1b9248b1 · report

Tasks

Information RetrievalRetrieval

2 archive task tags without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

SPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections