Towards Lossless Token Pruning in Late-Interaction Retrieval Models

Yuxuan Zong, Benjamin Piwowarski
4/17/2025
cs.IRcs.AIcs.CL

No official code found. Best implementation: yzong12138/MVDR_pruning (19 stars, last commit 2025-06-11).

Abstract

Late interaction neural IR models like ColBERT offer a competitive effectiveness-efficiency trade-off across many benchmarks. However, they require a huge memory space to store the contextual representation for all the document tokens. Some works have proposed using either heuristics or statistical-based techniques to prune tokens from each document. This however doesn't guarantee that the removed tokens have no impact on the retrieval score. Our work uses a principled approach to define how to prune tokens without impacting the score between a document and a query. We introduce three regularization losses, that induce a solution with high pruning ratios, as well as two pruning strategies. We study them experimentally (in and out-domain), showing that we can preserve ColBERT's performance while using only 30\% of the tokens.

View on arXivView PDF

Code Implementations(1)

A project which does the ColBERT pruning based on the LP or L1 norm

190PythonApr 8, 20251 years ago

Similar Papers

Cite this paper

@article{zong2025towards,
  title  = {Towards Lossless Token Pruning in Late-Interaction Retrieval Models},
  author = {Yuxuan Zong and Benjamin Piwowarski},
  year   = {2025},
  eprint = {2504.12778},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.12778v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.12778.svg)](https://codeofpaper.com/paper/2504.12778)

Discussion