On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspective
Not on the map. Why?
Abstract (arXiv)
Content-based Recommender Systems (CRSs) play a crucial role in shaping user experiences in e-commerce, online advertising, and personalized recommendations. However, due to the vast amount of categorical features, the embedding tables used in CRS models pose a significant storage bottleneck for real-world deployment, especially on resource-constrained devices. To address this problem, various embedding pruning methods have been proposed, but most existing ones require expensive retraining steps for each target parameter budget, leading to enormous computation costs. In reality, this computation cost is a major hurdle in real-world applications with diverse storage requirements, such as federated learning and streaming settings. In this paper, we propose Shapley Value-guided Embedding Reduction (Shaver) as our response. With Shaver, we view the problem from a cooperative game perspective, and quantify each embedding parameter's contribution with Shapley values to facilitate contribution-based parameter pruning. To address the inherently high computation costs of Shapley values, we propose an efficient and unbiased method to estimate Shapley values of a CRS's embedding parameters. Moreover, in the pruning stage, we put forward a field-aware codebook to mitigate the information loss in the traditional zero-out treatment. Through extensive experiments on three real-world datasets, Shaver has demonstrated competitive performance with lightweight recommendation models across various parameter budgets. The source code is available at https://github.com/chenxing1999/shaver
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 50 of its 77 references that are in the map. First posted on arXiv 20 Nov 2024.
Builds on
50 of 77 references.
References · 50
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,329
- 2017Neural Collaborative Filteringcited by 1,111
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
- 2021A White Paper on Neural Network Quantizationcited by 472
- 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 327
- 2018Slimmable Neural Networkscited by 305
- 2020Improving KernelSHAP: Practical Shapley Value Estimation via Linear Regressioncited by 154
- 2021FastSHAP: Real-Time Shapley Value Estimationcited by 125
- 2022Algorithms to estimate Shapley value feature attributionscited by 115
38 more
- 2020Neuron Shapley: Discovering the Responsible Neuronscited by 98
- 2021Software-Hardware Co-design for Fast and Scalable Training of Deep Learning Recommendation Modelscited by 78
- 2019Compositional Embeddings Using Complementary Partitions for Memory-Efficient Recommendation Systemscited by 68
- 2021TT-Rec: Tensor Train Compression for Deep Learning Recommendation Modelscited by 58
- 2022BARS: Towards Open Benchmarking for Recommender Systemscited by 54
- 2020AutoEmb: Automated Embedding Dimensionality Search in Streaming Recommendationscited by 47
- 2021Learnable Embedding Sizes for Recommender Systemscited by 42
- 2021Few-shot Backdoor Defense Using Shapley Estimationcited by 41
- 2019Neural Input Search for Large Scale Recommendation Modelscited by 39
- 2020Learning to Embed Categorical Features without Embedding Tables for Recommendationcited by 38
- 2018A Game-Theoretic Approach to Recommendation Systems with Strategic Content Providerscited by 33
- 2021The Shapley Value of Classifiers in Ensemble Gamescited by 23
- 2019Post-Training 4-bit Quantization on Embedding Tablescited by 22
- 2022On-Device Next-Item Recommendation with Self-Supervised Knowledge Distillationcited by 21
- 2022Real-time Short Video Recommendation on Mobile Devicescited by 21
- 2024Stochastic Amortization: A Unified Approach to Accelerate Feature and Data Attributioncited by 21
- 2024On-Device Recommender Systems: A Comprehensive Surveycited by 20
- 2021Learning Elastic Embeddings for Customizing On-Device Recommenderscited by 19
- 2020Mixed-Precision Embedding Using a Cachecited by 18
- 2022OptEmbed: Learning Optimal Embedding Table for Click-through Rate Predictioncited by 14
- 2023Unified Embedding: Battle-Tested Feature Representations for Web-Scale ML Systemscited by 14
- 2024Embedding Compression in Recommender Systems: A Surveycited 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
- 2023Experimental Analysis of Large-scale Learnable Vector Storage Compressioncited by 12
- 2023Clustered Embedding Learning for Recommender Systemscited by 8
- 2023Continuous Input Embedding Size Search For Recommender Systemscited by 7
- 2023CAFE: Towards Compact, Adaptive, and Fast Embedding for Large-scale Recommendation Modelscited by 7
- 2024Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendationcited by 7
- 2023Budgeted Embedding Table For Recommender Systemscited by 6
- 2024Lightweight Embeddings for Graph Collaborative Filteringcited by 5
- 2023Personalized Elastic Embedding Learning for On-Device Recommendationcited by 4
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systemscited by 4
- 2023Towards Communication-Efficient Model Updating for On-Device Session-Based Recommendationcited by 3
- 2024Sparser Training for On-Device Recommendation Systemscited by 3
- 2023On-Device Recommender Systems: A Tutorial on The New-Generation Recommendation Paradigmcited by 2
- 2024Scalable Dynamic Embedding Size Search for Streaming Recommendationcited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.