SHARK: A Lightweight Model Compression Approach for Large-scale Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Increasing the size of embedding layers has shown to be effective in improving the performance of recommendation models, yet gradually causing their sizes to exceed terabytes in industrial recommender systems, and hence the increase of computing and storage costs. To save resources while maintaining model performances, we propose SHARK, the model compression practice we have summarized in the recommender system of industrial scenarios. SHARK consists of two main components. First, we use the novel first-order component of Taylor expansion as importance scores to prune the number of embedding tables (feature fields). Second, we introduce a new row-wise quantization method to apply different quantization strategies to each embedding. We conduct extensive experiments on both public and industrial datasets, demonstrating that each component of our proposed SHARK framework outperforms previous approaches. We conduct A/B tests in multiple models on Kuaishou, such as short video, e-commerce, and advertising recommendation models. The results of the online A/B test showed SHARK can effectively reduce the memory footprint of the embedded layer. For the short-video scenarios, the compressed model without any performance drop significantly saves 70% storage and thousands of machines, improves 30% queries per second (QPS), and has been deployed to serve hundreds of millions of users and process tens of billions of requests every day.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Aug 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 2.
6 papers.
- 2024ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systemscited by 9
- 2024Performance-Driven QUBO for Recommender Systems on Quantum Annealerscited by 0
- 2025ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learningcited by 0
- 2025DimGrow: Memory-Efficient Field-level Embedding Dimension Searchcited by 0
- 2026FairFS: Addressing Deep Feature Selection Biases for Recommender Systemcited by 0
- 2026LeAP: Learnable Adaptive Permutation for Feature Selection in Heterogeneous and Sparse Recommender Systemscited by 0
- 2026LeAP: Learnable Adaptive Permutation for Feature Selection in Heterogeneous and Sparse Recommender Systems31 May 2026
- 2026FairFS: Addressing Deep Feature Selection Biases for Recommender System23 Feb 2026
- 2025DimGrow: Memory-Efficient Field-level Embedding Dimension Search19 May 2025
- 2025ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learning12 Mar 2025
- 2024Performance-Driven QUBO for Recommender Systems on Quantum Annealers20 Oct 2024
- 2024ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systems19 Mar 2024