Learning To Hash For Recommendation: A Survey

Abstract

With the explosive growth of users and items, Recommender Systems are facing unprecedented challenges in terms of retrieval efficiency and storage overhead. Learning to Hash techniques have emerged as a promising solution to these issues by encoding high-dimensional data into compact hash codes. As a result, hashing-based recommendation methods (HashRec) have garnered growing attention for enabling large-scale and efficient recommendation services. This survey provides a comprehensive overview of state-of-the-art HashRec algorithms. Specifically, we begin by introducing the common two-tower architecture used in the recall stage and by detailing two predominant hash search strategies. Then, we categorize existing works into a three-tier taxonomy based on: (i) learning objectives, (ii) optimization strategies, and (iii) recommendation scenarios. Additionally, we summarize widely adopted evaluation metrics for assessing both the effectiveness and efficiency of HashRec algorithms. Finally,

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyluo2024learning

Related papers

• Learning To Collide: Recommendation System Model Compression With Learned Hash Functions (2022)0.00
• Collaborative Group-aware Hashing For Fast Recommender Systems (2025)0.00
• Learning To Hash With Graph Neural Networks For Recommender Systems (2020)14.02
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00
• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• A Survey On Learning To Hash (2016)21.62
• Representation Learning For Efficient And Effective Similarity Search And Recommendation (2021)0.00
• Collaborative Generative Hashing For Marketing And Fast Cold-start Recommendation (2020)7.81