Clustering The Sketch: A Novel Approach To Embedding Table Compression

Abstract

Embedding tables are used by machine learning systems to work with categorical features. In modern Recommendation Systems, these tables can be very large, necessitating the development of new methods for fitting them in memory, even during training. We suggest Clustered Compositional Embeddings (CCE) which combines clustering-based compression like quantization to codebooks with dynamic methods like The Hashing Trick and Compositional Embeddings (Shi et al., 2020). Experimentally CCE achieves the best of both worlds: The high compression rate of codebook-based quantization, but *dynamically* like hashing-based methods, so it can be used during training. Theoretically, we prove that CCE is guaranteed to converge to the optimal codebook and give a tight bound for the number of iterations required.

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keytsang2022clustering

Related papers

• CAFE: Towards Compact, Adaptive, And Fast Embedding For Large-scale Recommendation Models (2023)8.09
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• Learning Compressed Embeddings For On-device Inference (2022)0.00
• Learning To Collide: Recommendation System Model Compression With Learned Hash Functions (2022)0.00
• Streaming Binary Sketching Based On Subspace Tracking And Diagonal Uniformization (2017)0.00
• Multi-probe Zero Collision Hash (MPZCH): Mitigating Embedding Collisions And Enhancing Model Freshness In Large-scale Recommenders (2026)0.00
• Experimental Analysis Of Large-scale Learnable Vector Storage Compression (2023)7.50
• Mixed-precision Embeddings For Large-scale Recommendation Models (2024)0.00