Late-interaction models such as ColBERT offer competitive performance across various retrieval tasks but require storing a dense embedding for each document token, leading to a substantial index storage overhead. Past works address this by attempting to prune low-importance token embeddings based on statistical and empirical measures, but they often either lack formal grounding or are ineffective. To address these shortcomings, we introduce a framework grounded in hyperspace geometry and cast token pruning as a Voronoi cell estimation problem in the embedding space. By interpreting each token's influence as a measure of its Voronoi region, our approach enables principled pruning that retains retrieval quality while reducing index size. Through our experiments, we demonstrate that this approach serves not only as a competitive pruning strategy but also as a valuable tool for improving and interpreting token-level behavior within dense retrieval systems.
@article{arxiv.2603.09933,
title = {A Voronoi Cell Formulation for Principled Token Pruning in Late-Interaction Retrieval Models},
author = {Yash Kankanampati and Yuxuan Zong and Nadi Tomeh and Benjamin Piwowarski and Joseph Le Roux},
journal= {arXiv preprint arXiv:2603.09933},
year = {2026}
}
Comments
Accepted at SIGIR 2026 Full Paper Track; 11 pages; 7 figures