The reviewed record of science sign in
Pith

arxiv: 2404.13950 · v1 · pith:HVUN4QOQ · submitted 2024-04-22 · cs.IR

SPLATE: Sparse Late Interaction Retrieval

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HVUN4QOQrecord.jsonopen to challenge →

classification cs.IR
keywords interactionlateretrievalcolbertv2sparsesplatecandidatecolbert
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.