TensorX
返回文献探索

Paper · arXiv 2409.14683

Reducing the Footprint of Multi-Vector Retrieval with Minimal Performance Impact via Token Pooling

Benjamin Clavié, Antoine Chaffin, Griffin Adams

11 upvotesSeptember 23, 2024arXiv 预印本
AI 摘要

A clustering-based token pooling method significantly reduces the storage and memory requirements of ColBERT indexes without compromising retrieval performance.

multi-vector retrievalColBERTtoken leveldocument levelretrieval performancevector poolingclustering-based poolingColBERT indexesquery-time processing

Abstract

Over the last few years, multi-vector retrieval methods, spearheaded by ColBERT, have become an increasingly popular approach to Neural IR. By storing representations at the token level rather than at the document level, these methods have demonstrated very strong retrieval performance, especially in out-of-domain settings. However, the storage and memory requirements necessary to store the large number of associated vectors remain an important drawback, hindering practical adoption. In this paper, we introduce a simple clustering-based token pooling approach to aggressively reduce the number of vectors that need to be stored. This method can reduce the space & memory footprint of ColBERT indexes by 50% with virtually no retrieval performance degradation. This method also allows for further reductions, reducing the vector count by 66%-to-75% , with degradation remaining below 5% on a vast majority of datasets. Importantly, this approach requires no architectural change nor query-time processing, and can be used as a simple drop-in during indexation with any ColBERT-like model.

北京市昌平区探索星信息技术及软件开发工作室

京ICP备2026059466号
Reducing the Footprint of Multi-Vector Retrieval with Minimal Performance Impact via Token Pooling | TensorX