TL;DR
This paper introduces a memory-efficient embedding technique for recommendation systems that uses complementary partitions to generate unique category embeddings, significantly reducing memory usage while maintaining accuracy.
Contribution
The authors propose a novel end-to-end method leveraging complementary partitions to create unique embeddings without large tables, improving memory efficiency in recommendation models.
Findings
Outperforms hashing trick in reducing embedding size and maintaining accuracy.
Achieves similar memory reduction with improved model loss and accuracy.
Effective for large-scale categorical data in recommendation systems.
Abstract
Modern deep learning-based recommendation systems exploit hundreds to thousands of different categorical features, each with millions of different categories ranging from clicks to posts. To respect the natural diversity within the categorical data, embeddings map each category to a unique dense representation within an embedded space. Since each categorical feature could take on as many as tens of millions of different possible categories, the embedding tables form the primary memory bottleneck during both training and inference. We propose a novel approach for reducing the embedding size in an end-to-end fashion by exploiting complementary partitions of the category set to produce a unique embedding vector for each category without explicit definition. By storing multiple smaller embedding tables based on each complementary partition and combining embeddings from each table, we define…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
