Pith. sign in

REVIEW 1 cited by

SPLATE: Sparse 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 2404.13950 v1 pith:HVUN4QOQ submitted 2024-04-22 cs.IR

classification cs.IR
keywords interactionlateretrievalcolbertv2sparsesplatecandidatecolbert
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The late interaction paradigm introduced with ColBERT stands out in the neural Information Retrieval space, offering a compelling effectiveness-efficiency trade-off across many benchmarks. Efficient late interaction retrieval is based on an optimized multi-step strategy, where an approximate search first identifies a set of candidate documents to re-rank exactly. In this work, we introduce SPLATE, a simple and lightweight adaptation of the ColBERTv2 model which learns an ``MLM adapter'', mapping its frozen token embeddings to a sparse vocabulary space with a partially learned SPLADE module. This allows us to perform the candidate generation step in late interaction pipelines with traditional sparse retrieval techniques, making it particularly appealing for running ColBERT in CPU environments. Our SPLATE ColBERTv2 pipeline achieves the same effectiveness as the PLAID ColBERTv2 engine by re-ranking 50 documents that can be retrieved under 10ms.

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