HPC-ColPali compresses ColPali's patch embeddings via K-means quantization, attention-based pruning, and binary Hamming search, but all reported numbers are estimates, not measurements.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IR 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Hierarchical Patch Compression for ColPali: Efficient Multi-Vector Document Retrieval with Dynamic Pruning and Quantization
HPC-ColPali compresses ColPali's patch embeddings via K-means quantization, attention-based pruning, and binary Hamming search, but all reported numbers are estimates, not measurements.