Single-shot Embedding Dimension Search in Recommender System
Not on the map. Why?
Abstract (arXiv)
As a crucial component of most modern deep recommender systems, feature embedding maps high-dimensional sparse user/item features into low-dimensional dense embeddings. However, these embeddings are usually assigned a unified dimension, which suffers from the following issues: (1) high memory usage and computation cost. (2) sub-optimal performance due to inferior dimension assignments. In order to alleviate the above issues, some works focus on automated embedding dimension search by formulating it as hyper-parameter optimization or embedding pruning problems. However, they either require well-designed search space for hyperparameters or need time-consuming optimization procedures. In this paper, we propose a Single-Shot Embedding Dimension Search method, called SSEDS, which can efficiently assign dimensions for each feature field via a single-shot embedding pruning operation while maintaining the recommendation accuracy of the model. Specifically, it introduces a criterion for identifying the importance of each embedding dimension for each feature field. As a result, SSEDS could automatically obtain mixed-dimensional embeddings by explicitly reducing redundant embedding dimensions based on the corresponding dimension importance ranking and the predefined parameter budget. Furthermore, the proposed SSEDS is model-agnostic, meaning that it could be integrated into different base recommendation models. The extensive offline experiments are conducted on two widely used public datasets for CTR prediction tasks, and the results demonstrate that SSEDS can still achieve strong recommendation performance even if it has reduced 90% parameters. Moreover, SSEDS has also been deployed on the WeChat Subscription platform for practical recommendation services. The 7-day online A/B test results show that SSEDS can significantly improve the performance of the online recommendation model.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Apr 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 6; 2025: 3.
13 papers.
Sort:
- 2023Semi-decentralized Federated Ego Graph Learning for Recommendationcited by 22
- 2023Embedding in Recommender Systems: A Surveycited by 19
- 2023Experimental Analysis of Large-scale Learnable Vector Storage Compressioncited by 12
- 2024Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendationcited by 7
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systemscited by 4
- 2022Boosting Factorization Machines via Saliency-Guided Mixupcited by 3
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systemscited by 3
- 2024On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspectivecited by 2
- 2024Fine-Grained Embedding Dimension Optimization During Training for Recommender Systemscited by 1
- 2024Unified Low-rank Compression Framework for Click-through Rate Predictioncited by 0
- 2024AdaS&S: a One-Shot Supernet Approach for Automatic Embedding Size Search in Deep Recommender Systemcited by 0
- 2025ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learningcited by 0
1 more
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems24 Jun 2025
- 2025DimGrow: Memory-Efficient Field-level Embedding Dimension Search19 May 2025
- 2025ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learning12 Mar 2025
- 2024On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspective20 Nov 2024
- 2024AdaS&S: a One-Shot Supernet Approach for Automatic Embedding Size Search in Deep Recommender System12 Nov 2024
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems25 Jun 2024
- 2024Unified Low-rank Compression Framework for Click-through Rate Prediction28 May 2024
- 2024Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation5 Feb 2024
- 2024Fine-Grained Embedding Dimension Optimization During Training for Recommender Systems9 Jan 2024
- 2023Experimental Analysis of Large-scale Learnable Vector Storage Compression27 Nov 2023
- 2023Embedding in Recommender Systems: A Survey28 Oct 2023
- 2023Semi-decentralized Federated Ego Graph Learning for Recommendation10 Feb 2023
1 more
- 2022Boosting Factorization Machines via Saliency-Guided Mixup17 Jun 2022
- 2023Semi-decentralized Federated Ego Graph Learning for Recommendationcited by 22
- 2023Embedding in Recommender Systems: A Surveycited by 19
- 2023Experimental Analysis of Large-scale Learnable Vector Storage Compressioncited by 12
- 2024Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendationcited by 7
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systemscited by 4
- 2022Boosting Factorization Machines via Saliency-Guided Mixupcited by 3
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systemscited by 3
- 2024On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspectivecited by 2
- 2024Fine-Grained Embedding Dimension Optimization During Training for Recommender Systemscited by 1
- 2024Unified Low-rank Compression Framework for Click-through Rate Predictioncited by 0
- 2024AdaS&S: a One-Shot Supernet Approach for Automatic Embedding Size Search in Deep Recommender Systemcited by 0
- 2025ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learningcited by 0
12 most cited of 13 All 13 (JSON)
- 2025CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems24 Jun 2025
- 2025DimGrow: Memory-Efficient Field-level Embedding Dimension Search19 May 2025
- 2025ShuffleGate: Scalable Feature Optimization for Recommender Systems via Batch-wise Sensitivity Learning12 Mar 2025
- 2024On-device Content-based Recommendation with Single-shot Embedding Pruning: A Cooperative Game Perspective20 Nov 2024
- 2024AdaS&S: a One-Shot Supernet Approach for Automatic Embedding Size Search in Deep Recommender System12 Nov 2024
- 2024A Thorough Performance Benchmarking on Lightweight Embedding-based Recommender Systems25 Jun 2024
- 2024Unified Low-rank Compression Framework for Click-through Rate Prediction28 May 2024
- 2024Dynamic Sparse Learning: A Novel Paradigm for Efficient Recommendation5 Feb 2024
- 2024Fine-Grained Embedding Dimension Optimization During Training for Recommender Systems9 Jan 2024
- 2023Experimental Analysis of Large-scale Learnable Vector Storage Compression27 Nov 2023
- 2023Embedding in Recommender Systems: A Survey28 Oct 2023
- 2023Semi-decentralized Federated Ego Graph Learning for Recommendation10 Feb 2023
12 newest of 13 All 13 (JSON)