Research map / Learning theory and algorithms / Prediction and decision losses
Learning Deep Tree-Based Retriever for Efficient Recommendation: Theory and Method
Ze Liu, Jin Zhang, Defu Lian, Chao Feng, Jie Wang, Enhong Chen
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use brute-force DIN instead of YouTubeDNN inner-product retrieval | brute-force retrieval · Movie (MovieLens 10M) | Precision@20: 0.2043 -> 0.2132 | Improved |
| use brute-force DIN instead of YouTubeDNN inner-product retrieval | brute-force retrieval · MIND (Small Dev) | Recall@40: 0.2851 -> 0.2930 | Improved |
Closest papers by meaning
- Joint Optimization of Tree-based Index and Deep Model for Recommender Systems (NeurIPS 2019 · similarity 0.91)
- Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations (ICML 2024 · similarity 0.87)
- On Softmax Direct Preference Optimization for Recommendation (NeurIPS 2024 · similarity 0.85)
- SHARP-Distill: A 68× Faster Recommender System with Hypergraph Neural Networks and Language Models (ICML 2025 · similarity 0.85)
- STEM: Unleashing the Power of Embeddings for Multi-Task Recommendation (AAAI 2024 · similarity 0.85)
- Tree of Preferences for Diversified Recommendation (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
