Experimental Analysis Of Large-scale Learnable Vector Storage Compression

Abstract

Learnable embedding vector is one of the most important applications in machine learning, and is widely used in various database-related domains. However, the high dimensionality of sparse data in recommendation tasks and the huge volume of corpus in retrieval-related tasks lead to a large memory consumption of the embedding table, which poses a great challenge to the training and deployment of models. Recent research has proposed various methods to compress the embeddings at the cost of a slight decrease in model quality or the introduction of other overheads. Nevertheless, the relative performance of these methods remains unclear. Existing experimental comparisons only cover a subset of these methods and focus on limited metrics. In this paper, we perform a comprehensive comparative analysis and experimental evaluation of embedding compression. We introduce a new taxonomy that categorizes these techniques based on their characteristics and methodologies, and further develop a modular

Stats

• citations9
• S2 citations—
• github stars0
• HF likes0
• heat score7.50
• arxiv keyzhang2023experimental

Related papers

• Corect: A Framework For Evaluating Embedding Compression Techniques At Scale (2025)0.00
• Leanvec: Searching Vectors Faster By Making Them Fit (2023)0.00
• Mixed-precision Embeddings For Large-scale Recommendation Models (2024)0.00
• Optimization Of Latent-space Compression Using Game-theoretic Techniques For Transformer-based Vector Search (2025)0.00
• Optimization Of Embeddings Storage For RAG Systems Using Quantization And Dimensionality Reduction Techniques (2025)0.00
• Gleanvec: Accelerating Vector Search With Minimalist Nonlinear Dimensionality Reduction (2024)0.00
• SMEC: Rethinking Matryoshka Representation Learning For Retrieval Embedding Compression (2025)0.00
• Efficient Learning Of Sparse Representations From Interactions (2026)1.57