Abstract:Recent high-performing text embedding models often output high-dimensional real-valued vectors, resulting in substantial storage and computational costs. To address this issue, compression methods based on dimensionality reduction or quantization have been proposed; however, the effects of combining dimensionality reduction and quantization have not been sufficiently investigated. In this paper, we systematically examine the effectiveness of compressing text embeddings by combining dimensionality reduction and quantization, using four MTEB task families and four pretrained embedding models. The experimental results demonstrate that combining dimensionality reduction and quantization enables substantially stronger compression than using either method alone, that in some settings embeddings can be reduced to as little as 0.1% of their original size with almost no performance degradation, and that the optimal compression strategy depends on the task.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2606.01074 [cs.CL] |
| (or arXiv:2606.01074v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2606.01074 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Riku Kisako [view email]
[v1]
Sun, 31 May 2026 07:37:34 UTC (431 KB)
