pith. sign in

arxiv: 2010.11305 · v2 · pith:2C6N4PJAnew · submitted 2020-10-21 · 💻 cs.LG · cs.AI· cs.DC

Mixed-Precision Embedding Using a Cache

classification 💻 cs.LG cs.AIcs.DC
keywords embeddingtablesprecisioncachememorymodelreductiontrained
0
0 comments X
read the original abstract

In recommendation systems, practitioners observed that increase in the number of embedding tables and their sizes often leads to significant improvement in model performances. Given this and the business importance of these models to major internet companies, embedding tables for personalization tasks have grown to terabyte scale and continue to grow at a significant rate. Meanwhile, these large-scale models are often trained with GPUs where high-performance memory is a scarce resource, thus motivating numerous work on embedding table compression during training. We propose a novel change to embedding tables using a cache memory architecture, where the majority of rows in an embedding is trained in low precision, and the most frequently or recently accessed rows cached and trained in full precision. The proposed architectural change works in conjunction with standard precision reduction and computer arithmetic techniques such as quantization and stochastic rounding. For an open source deep learning recommendation model (DLRM) running with Criteo-Kaggle dataset, we achieve 3x memory reduction with INT8 precision embedding tables and full-precision cache whose size are 5% of the embedding tables, while maintaining accuracy. For an industrial scale model and dataset, we achieve even higher >7x memory reduction with INT4 precision and cache size 1% of embedding tables, while maintaining accuracy, and 16% end-to-end training speedup by reducing GPU-to-host data transfers.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learning

    cs.LG 2025-03 unverdicted novelty 5.0

    ShuffleGate learns polarized importance gates by measuring model sensitivity to random component shuffling, unifying feature selection, dimension selection, and embedding compression with SOTA results on four recommen...

  2. FreeScale: Distributed Training for Sequence Recommendation Models with Minimal Scaling Cost

    cs.LG 2026-04 unverdicted novelty 4.0

    FreeScale reduces computational bubbles by up to 90.3% in distributed training of sequence recommendation models on 256 H100 GPUs via load balancing, prioritized embedding overlap, and SM-Free communication.