Learnable Embedding Sizes for Recommender Systems
Siyi Liu, Chen Gao, Yihong Chen, Depeng Jin, Yong Li

TL;DR
This paper introduces PEP, a method that adaptively prunes embedding sizes in recommendation models, significantly reducing memory usage and improving performance without sacrificing accuracy.
Contribution
The paper proposes PEP, a novel framework for learnable, adaptive embedding size pruning that maintains recommendation accuracy while drastically reducing embedding parameters.
Findings
Reduces embedding parameters by 97-99%.
Maintains or improves recommendation accuracy.
Adds only 20-30% additional computation cost.
Abstract
The embedding-based representation learning is commonly used in deep learning recommendation models to map the raw sparse features to dense vectors. The traditional embedding manner that assigns a uniform size to all features has two issues. First, the numerous features inevitably lead to a gigantic embedding table that causes a high memory usage cost. Second, it is likely to cause the over-fitting problem for those features that do not require too large representation capacity. Existing works that try to address the problem always cause a significant drop in recommendation performance or suffers from the limitation of unaffordable training time cost. In this paper, we proposed a novel approach, named PEP (short for Plug-in Embedding Pruning), to reduce the size of the embedding table while avoiding the drop of recommendation accuracy. PEP prunes embedding parameter where the pruning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsRecommender Systems and Techniques · Caching and Content Delivery · Advanced Graph Neural Networks
MethodsPruning
