Learning Tree-based Deep Model For Recommender Systems

Abstract

Model-based methods for recommender systems have been studied extensively in recent years. In systems with large corpus, however, the calculation cost for the learnt model to predict all user-item preferences is tremendous, which makes full corpus retrieval extremely difficult. To overcome the calculation barriers, models such as matrix factorization resort to inner product form (i.e., model user-item preference as the inner product of user, item latent factors) and indexes to facilitate efficient approximate k-nearest neighbor searches. However, it still remains challenging to incorporate more expressive interaction forms between user and item features, e.g., interactions through deep neural networks, because of the calculation cost. In this paper, we focus on the problem of introducing arbitrary advanced models to recommender systems with large corpus. We propose a novel tree-based method which can provide logarithmic complexity w.r.t. corpus size even with more expressive models s

Stats

• citations222
• S2 citations—
• github stars0
• HF likes0
• heat score17.61
• arxiv keyzhu2018learning

Related papers

• STAR: A Simple Training-free Approach For Recommendations Using Large Language Models (2024)0.00
• Deep Retrieval: Learning A Retrievable Structure For Large-scale Recommendations (2020)0.00
• Learning Compact Compositional Embeddings Via Regularized Pruning For Recommendation (2023)8.36
• Hierarchical Structured Neural Network: Efficient Retrieval Scaling For Large Scale Recommendation (2024)0.00
• Path-based Deep Network For Candidate Item Matching In Recommenders (2021)7.81
• Learning Similarity Preserving Binary Codes For Recommender Systems (2022)0.00
• Embedding In Recommender Systems: A Survey (2023)0.00
• Joint Modeling And Optimization Of Search And Recommendation (2018)0.00