Candidate Generation With Binary Codes For Large-scale Top-n Recommendation

Abstract

Generating the Top-N recommendations from a large corpus is computationally expensive to perform at scale. Candidate generation and re-ranking based approaches are often adopted in industrial settings to alleviate efficiency problems. However it remains to be fully studied how well such schemes approximate complete rankings (or how many candidates are required to achieve a good approximation), or to develop systematic approaches to generate high-quality candidates efficiently. In this paper, we seek to investigate these questions via proposing a candidate generation and re-ranking based framework (CIGAR), which first learns a preference-preserving binary embedding for building a hash table to retrieve candidates, and then learns to re-rank the candidates using real-valued ranking models with a candidate-oriented objective. We perform a comprehensive study on several large-scale real-world datasets consisting of millions of users/items and hundreds of millions of interactions. Our resul

Stats

• citations43
• S2 citations—
• github stars0
• HF likes0
• heat score12.33
• arxiv keykang2019candidate

Related papers

• Collaborative Generative Hashing For Marketing And Fast Cold-start Recommendation (2020)7.81
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00
• Grank: Towards Target-aware And Streamlined Industrial Retrieval With A Generate-rank Framework (2025)0.00
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• Cost: Contrastive Quantization Based Semantic Tokenization For Generative Recommendation (2024)7.81
• Deep Retrieval: Learning A Retrievable Structure For Large-scale Recommendations (2020)0.00
• Onepiece: The Great Route To Generative Recommendation -- A Case Study From Tencent Algorithm Competition (2025)0.00
• Hierarchical Structured Neural Network: Efficient Retrieval Scaling For Large Scale Recommendation (2024)0.00