Alternate Model Growth and Pruning for Efficient Training of Recommendation Systems
Not on the map. Why?
Abstract (arXiv)
Deep learning recommendation systems at scale have provided remarkable gains through increasing model capacity (i.e. wider and deeper neural networks), but it comes at significant training cost and infrastructure cost. Model pruning is an effective technique to reduce computation overhead for deep neural networks by removing redundant parameters. However, modern recommendation systems are still thirsty for model capacity due to the demand for handling big data. Thus, pruning a recommendation model at scale results in a smaller model capacity and consequently lower accuracy. To reduce computation cost without sacrificing model capacity, we propose a dynamic training scheme, namely alternate model growth and pruning, to alternatively construct and prune weights in the course of training. Our method leverages structured sparsification to reduce computational cost without hurting the model capacity at the end of offline training so that a full-size model is available in the recurring training stage to learn new data in real-time. To the best of our knowledge, this is the first work to provide in-depth experiments and discussion of applying structural dynamics to recommendation systems at scale to reduce training cost. The proposed method is validated with an open-source deep-learning recommendation model (DLRM) and state-of-the-art industrial-scale production models.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 29 of its 40 references that are in the map. First posted on arXiv 4 May 2021.
Builds on
29 of 40 references.
References · 29
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2016Wide & Deep Learning for Recommender Systemscited by 745
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2018PACT: Parameterized Clipping Activation for Quantized Neural Networkscited by 456
- 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 413
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
- 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
- 2018Model compression via distillation and quantizationcited by 287
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2014Compressing Deep Convolutional Networks using Vector Quantizationcited by 189
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 150
17 more
- 2019The Architectural Implications of Facebook's DNN-based Personalized Recommendationcited by 83
- 2015Fast ConvNets Using Group-wise Brain Damagecited by 81
- 2016Learning the Number of Neurons in Deep Networkscited by 69
- 2020Compression of Deep Learning Models for Text: A Surveycited by 64
- 2017Extremely Low Bit Neural Network: Squeeze the Last Bit Out with ADMMcited by 60
- 2017NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigmcited by 60
- 2020DeepRecSys: A System for Optimizing End-To-End At-scale Neural Recommendation Inferencecited by 54
- 2020Understanding Training Efficiency of Deep Learning Recommendation Models at Scalecited by 43
- 2020Deep Learning Training in Facebook Data Centers: Design of Scale-up and Scale-out Systemscited by 37
- 2020Growing Efficient Deep Networks by Structured Continuous Sparsificationcited by 28
- 2018Structured Pruning for Efficient ConvNets via Incremental Regularizationcited by 15
- 2016DSD: Dense-Sparse-Dense Training for Deep Neural Networkscited by 7
- 2020Incremental Training of a Recurrent Neural Network Exploiting a Multi-Scale Dynamic Memorycited by 4
- 2020Adaptive Dense-to-Sparse Paradigm for Pruning Online Recommendation System with Non-Stationary Datacited by 4
- 2018Evaluating and Characterizing Incremental Learning from Non-Stationary Datacited by 3
- 2019CGaP: Continuous Growth and Pruning for Efficient Deep Learningcited by 3
- 2019Modeling Embedding Dimension Correlations via Convolutional Neural Collaborative Filteringcited by 1
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1.
3 papers.
- 2021RecPipe: Co-designing Models and Hardware to Jointly Optimize Recommendation Quality and Performancecited by 8
- 2022Future Gradient Descent for Adapting the Temporal Shifting Data Distribution in Online Recommendation Systemscited by 3
- 2023Learning to Rank Normalized Entropy Curves with Differentiable Window Transformationcited by 1
- 2023Learning to Rank Normalized Entropy Curves with Differentiable Window Transformation25 Jan 2023
- 2022Future Gradient Descent for Adapting the Temporal Shifting Data Distribution in Online Recommendation Systems2 Sep 2022
- 2021RecPipe: Co-designing Models and Hardware to Jointly Optimize Recommendation Quality and Performance18 May 2021