Learning to Collide: Recommendation System Model Compression with Learned Hash Functions
Benjamin Ghaemmaghami, Mustafa Ozdal, Rakesh Komuravelli, Dmitriy, Korchev, Dheevatsa Mudigere, Krishnakumar Nair, Maxim Naumov

TL;DR
This paper proposes Learned Hash Functions for recommendation models, which learn to map similar IDs to reduce embedding size while maintaining model quality, showing modest improvements over traditional hashing methods.
Contribution
Introduces a novel learned hashing approach that encourages semantic similarity-based collisions, improving model compression without significant quality loss.
Findings
Learned hash functions outperform traditional hashing in model compression.
Mapping based on access frequency and learned embeddings yields best results.
Ongoing work to further optimize collision control for better model performance.
Abstract
A key characteristic of deep recommendation models is the immense memory requirements of their embedding tables. These embedding tables can often reach hundreds of gigabytes which increases hardware requirements and training cost. A common technique to reduce model size is to hash all of the categorical variable identifiers (ids) into a smaller space. This hashing reduces the number of unique representations that must be stored in the embedding table; thus decreasing its size. However, this approach introduces collisions between semantically dissimilar ids that degrade model quality. We introduce an alternative approach, Learned Hash Functions, which instead learns a new mapping function that encourages collisions between semantically similar ids. We derive this learned mapping from historical data and embedding access patterns. We experiment with this technique on a production model…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Caching and Content Delivery · Data Stream Mining Techniques
