Fine-Grained Embedding Dimension Optimization During Training for Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Huge embedding tables in modern deep learning recommender models (DLRM) require prohibitively large memory during training and inference. This paper proposes FIITED, a system to automatically reduce the memory footprint via FIne-grained In-Training Embedding Dimension pruning. By leveraging the key insight that embedding vectors are not equally important, FIITED adaptively adjusts the dimension of each individual embedding vector during model training, assigning larger dimensions to more important embeddings while adapting to dynamic changes in data. We prioritize embedding dimensions with higher frequencies and gradients as more important. To enable efficient pruning of embeddings and their dimensions during model training, we propose an embedding storage system based on virtually-hashed physically-indexed hash tables. Experiments on two industry models and months of realistic datasets show that FIITED can reduce DLRM embedding size by more than 65% while preserving model quality, outperforming state-of-the-art in-training embedding pruning methods. On public datasets, FIITED can reduce the size of embedding tables by 2.1x to 800x with negligible accuracy drop, while improving model throughput.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 30 of its 56 references that are in the map. First posted on arXiv 9 Jan 2024.
Builds on
30 of 56 references.
References · 30
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
- 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 319
- 2018Beyond Data and Model Parallelism for Deep Neural Networkscited by 177
- 2020Distributed Hierarchical GPU Parameter Server for Massive Scale Deep Learning Ads Systemscited by 59
- 2020AutoEmb: Automated Embedding Dimensionality Search in Streaming Recommendationscited by 47
- 2020User Behavior Retrieval for Click-Through Rate Predictioncited by 44
- 2021Learnable Embedding Sizes for Recommender Systemscited by 42
- 2019Mixed Dimension Embeddings with Application to Memory-Efficient Recommendation Systemscited by 41
- 2019Neural Input Search for Large Scale Recommendation Modelscited by 39
- 2022Understanding Scaling Laws for Recommendation Modelscited by 38
- 2020Model Size Reduction Using Frequency Based Double Hashing for Recommender Systemscited by 33
18 more
- 2022AutoML for Deep Recommender Systems: A Surveycited by 29
- 2021HET: Scaling out Huge Embedding Model Training via Cache-enabled Distributed Frameworkcited by 28
- 2022RecShard: Statistical Feature-Based Memory Optimization for Industry-Scale Neural Recommendationcited by 28
- 2019Post-Training 4-bit Quantization on Embedding Tablescited by 21
- 2022Merlin HugeCTR: GPU-accelerated Recommender System Training and Inferencecited by 20
- 2021Learning Elastic Embeddings for Customizing On-Device Recommenderscited by 19
- 2020Mixed-Precision Embedding Using a Cachecited by 18
- 2021Persia: An Open, Hybrid System Scaling Deep Learning-based Recommenders up to 100 Trillion Parameterscited by 17
- 2020Differentiable Neural Input Search for Recommender Systemscited by 16
- 2018Bandana: Using Non-volatile Memory for Storing Deep Learning Modelscited by 14
- 2022OptEmbed: Learning Optimal Embedding Table for Click-through Rate Predictioncited by 14
- 2022Learning Compressed Embeddings for On-Device Inferencecited by 13
- 2022Single-shot Embedding Dimension Search in Recommender Systemcited by 13
- 2021Learning Effective and Efficient Embedding via an Adaptively-Masked Twins-based Layercited by 12
- 2021Binary Code based Hash Embedding for Web-scale Applicationscited by 11
- 2020Training with Multi-Layer Embeddings for Model Reductioncited by 6
- 2022A Frequency-aware Software Cache for Large Recommendation System Embeddingscited by 4
- 2022Field-wise Embedding Size Search via Structural Hard Auxiliary Mask Pruning for Click-Through Rate Predictioncited by 2
Built on by
Citing papers per year: 2024: 1.
1 paper.