mlsanityData to 7 Oct 2026

On component interactions in two-stage recommender systems

arXiv 2106.14979 ↗First posted 28 Jun 2021cs.IR cs.LG stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

Thanks to their scalability, two-stage recommenders are used by many of today's largest online platforms, including YouTube, LinkedIn, and Pinterest. These systems produce recommendations in two steps: (i) multiple nominators, tuned for low prediction latency, preselect a small subset of candidates from the whole item pool; (ii) a slower but more accurate ranker further narrows down the nominated items, and serves to the user. Despite their popularity, the literature on two-stage recommenders is relatively scarce, and the algorithms are often treated as mere sums of their parts. Such treatment presupposes that the two-stage performance is explained by the behavior of the individual components in isolation. This is not the case: using synthetic and real-world data, we demonstrate that interactions between the ranker and the nominators substantially affect the overall performance. Motivated by these findings, we derive a generalization lower bound which shows that independent nominator training can lead to performance on par with uniformly random recommendations. We find that careful design of item pools, each assigned to a different nominator, alleviates these issues. As manual search for a good pool allocation is difficult, we propose to learn one instead using a Mixture-of-Experts based approach. This significantly improves both precision and recall at K.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 39 of its 103 references that are in the map. First posted on arXiv 28 Jun 2021.

Builds on

39 of 103 references.

References · 39

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  5. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  6. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  7. 2017Neural Collaborative Filteringcited by 1,108
  8. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
  9. 2016Safe and Efficient Off-Policy Reinforcement Learningcited by 260
  10. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
  11. 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 200
  12. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
27 more
  1. 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
  2. 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 155
  3. 2019Is a Good Representation Sufficient for Sample Efficient Reinforcement Learning?cited by 140
  4. 2019Learning with Good Feature Representations in Bandits and in RL with a Generative Modelcited by 124
  5. 2020Bypassing the Monster: A Faster and Simpler Optimal Algorithm for Contextual Bandits under Realizabilitycited by 114
  6. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
  7. 2016Off-policy evaluation for slate recommendationcited by 102
  8. 2016Corralling a Band of Bandit Algorithmscited by 99
  9. 2018Learning Tree-based Deep Model for Recommender Systemscited by 99
  10. 2018Practical Contextual Bandits with Regression Oraclescited by 92
  11. 2017Mostly Exploration-Free Algorithms for Contextual Banditscited by 85
  12. 2018A Contextual Bandit Bake-offcited by 64
  13. 2017Pixie: A System for Recommending 3+ Billion Items to 200+ Million Users in Real-Timecited by 46
  14. 2019On the Difficulty of Evaluating Baselines: A Study on Recommender Systemscited by 46
  15. 2017Misspecified Linear Banditscited by 41
  16. 2018Estimating Position Bias without Intrusive Interventionscited by 31
  17. 2020Do Offline Metrics Predict Online Performance in Recommender Systems?cited by 25
  18. 2019Recommendations and User Agency: The Reachability of Collaboratively-Filtered Informationcited by 21
  19. 2020From Optimizing Engagement to Measuring Valuecited by 21
  20. 2019Candidate Generation with Binary Codes for Large-Scale Top-N Recommendationcited by 19
  21. 2019Adaptive Trade-Offs in Off-Policy Learningcited by 19
  22. 2020Learning from eXtreme Bandit Feedbackcited by 17
  23. 2019Hybrid Recommender Systems: A Systematic Literature Reviewcited by 16
  24. 2018Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithmscited by 13
  25. 2020Tractable contextual bandits beyond realizabilitycited by 8
  26. 2020Exploration in two-stage recommender systemscited by 4
  27. 2018A Smoothed Analysis of the Greedy Algorithm for the Linear Contextual Bandit Problemcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 5; 2023: 2; 2024: 3; 2025: 2; 2026: 2.

14 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2025A Self-Supervised Mixture-of-Experts Framework for Multi-behavior Recommendation
  2. 2018Recommendation Through Mixtures of Heterogeneous Item Relationships
  3. 2026CORAL: An LLM-Native Harness for Production Recommender Systems
  4. 2026Position: Recommender Systems Should Move Beyond Platform-Centric Ranking toward Personal Agent-Mediated Recommendation
  5. 2026Breaking User-Centric Agency: A Tri-Party Framework for Agent-Based Recommendation
  6. 2025Identifying Offline Metrics that Predict Online Impact: A Pragmatic Strategy for Real-World Recommender Systems
  7. 2022A Bird's-eye View of Reranking: from List Level to Page Level
  8. 2026RecRM-Bench: Benchmarking Multidimensional Reward Modeling for Agentic Recommender Systems