Pith. sign in

REVIEW 5 cited by

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 2505.11471 v1 pith:FZVZXAHQ submitted 2025-05-16 cs.IR

CRISP: Clustering Multi-Vector Representations for Denoising and Pruning

classification cs.IR
keywords clusteringcrispmulti-vectorrepresentationsmodelpruningtrainingvectors
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Multi-vector models, such as ColBERT, are a significant advancement in neural information retrieval (IR), delivering state-of-the-art performance by representing queries and documents by multiple contextualized token-level embeddings. However, this increased representation size introduces considerable storage and computational overheads which have hindered widespread adoption in practice. A common approach to mitigate this overhead is to cluster the model's frozen vectors, but this strategy's effectiveness is fundamentally limited by the intrinsic clusterability of these embeddings. In this work, we introduce CRISP (Clustered Representations with Intrinsic Structure Pruning), a novel multi-vector training method which learns inherently clusterable representations directly within the end-to-end training process. By integrating clustering into the training phase rather than imposing it post-hoc, CRISP significantly outperforms post-hoc clustering at all representation sizes, as well as other token pruning methods. On the BEIR retrieval benchmarks, CRISP achieves a significant rate of ~3x reduction in the number of vectors while outperforming the original unpruned model. This indicates that learned clustering effectively denoises the model by filtering irrelevant information, thereby generating more robust multi-vector representations. With more aggressive clustering, CRISP achieves an 11x reduction in the number of vectors with only a $3.6\%$ quality loss.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

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

  1. Quantifying and Expanding the Theoretical Capacity of Late-Interaction Retrieval Models

    cs.IR 2026-07 conditional novelty 7.0

    MaxSim similarity can exactly replicate inner products of non-negative sparse vectors of arbitrary dimension, and a proposed Signed MaxSim extension enables exact replication for arbitrary real-valued vectors.

  2. Visual Late Chunking: An Empirical Study of Contextual Chunking for Efficient Visual Document Retrieval

    cs.CV 2026-04 unverdicted novelty 7.0

    ColChunk adaptively chunks visual document patches into contextual multi-vectors via clustering, cutting storage by over 90% while raising average nDCG@5 by 9 points.

  3. A Voronoi Cell Formulation for Principled Token Pruning in Late-Interaction Retrieval Models

    cs.IR 2026-03 unverdicted novelty 6.0

    A Voronoi cell estimation framework in embedding space enables principled token pruning for late-interaction models, reducing index size while retaining retrieval quality.

  4. LEMUR: Learned Multi-Vector Retrieval

    cs.IR 2026-01 unverdicted novelty 6.0

    LEMUR accelerates multi-vector retrieval by learning a neural network approximation to MaxSim and reducing it to single-vector search in latent space.

  5. Learn to Pool: Lightweight Fine-Tuning for Flexible Multi-Vector Compression

    cs.IR 2026-07 conditional novelty 5.0

    Lightweight pooling-aware fine-tuning with k-means on a single dataset enables up to 83% vector compression in ColBERT models with no retrieval accuracy loss and positive cross-dataset transfer.