Embedding Compression
Overview
Embedding compression aims to make vector representations cheaper to store, transmit, and use without losing the information needed for downstream tasks. Methods include dimensionality reduction such as PCA, scalar and product quantization, binary hashing, pruning or pooling multi-vector representations, and learned codebooks or autoencoders. In retrieval, systems are often evaluated on benchmarks such as BEIR and MTEB using ranking quality alongside index size and latency; recommendation and on-device applications also measure parameter and compute costs. Very compact representations can work well, but the best method and acceptable tradeoff depend on the task, embedding geometry, and whether compression preserves reconstruction, similarity, or ranking quality.
Latest papers
49 papers10 papers in the last four weeks, up 43% on the four weeks before. 0.1% of all new papers.