mlsanityData to 7 Oct 2026

A Scalable Recommendation Engine for New Users and Items

arXiv 2209.06128 ↗First posted 6 Sep 2022cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

In many digital contexts such as online news and e-tailing with many new users and items, recommendation systems face several challenges: i) how to make initial recommendations to users with little or no response history (i.e., cold-start problem), ii) how to learn user preferences on items (test and learn), and iii) how to scale across many users and items with myriad demographics and attributes. While many recommendation systems accommodate aspects of these challenges, few if any address all. This paper introduces a Collaborative Filtering (CF) Multi-armed Bandit (B) with Attributes (A) recommendation system (CFB-A) to jointly accommodate all of these considerations. Empirical applications including an offline test on MovieLens data, synthetic data simulations, and an online grocery experiment indicate the CFB-A leads to substantial improvement on cumulative average rewards (e.g., total money or time spent, clicks, purchased quantities, average ratings, etc.) relative to the most powerful extant baseline methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 128 references that are in the map. First posted on arXiv 6 Sep 2022.

Builds on

23 of 128 references.

References · 23

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  2. 2018Generative Adversarial User Model for Reinforcement Learning Based Recommendation Systemcited by 64
  3. 2020Low-Rank Generalized Linear Bandit Problemscited by 48
  4. 2016On Context-Dependent Clustering of Banditscited by 43
  5. 2015A Survey on Contextual Multi-armed Banditscited by 34
  6. 2018Spectral Collaborative Filteringcited by 34
  7. 2017Stochastic Low-Rank Banditscited by 28
  8. 2019Solving Bernoulli Rank-One Bandits with Unimodal Thompson Samplingcited by 23
  9. 2017Estimation Considerations in Contextual Banditscited by 22
  10. 2016Matching while Learningcited by 19
  11. 2019Hybrid Recommender Systems: A Systematic Literature Reviewcited by 16
  12. 2018Multinomial Logit Bandit with Linear Utility Functionscited by 15
11 more
  1. 2016Hybrid Recommender System based on Autoencoderscited by 14
  2. 2020Bayesian Meta-Prior Learning Using Empirical Bayescited by 14
  3. 2017Online Interactive Collaborative Filtering Using Multi-Armed Bandit with Dependent Armscited by 13
  4. 2020Spoiled for Choice? Personalized Recommendation for Healthcare Decisions: A Multi-Armed Bandit Approachcited by 10
  5. 2018Cold-start recommendations in Collective Matrix Factorizationcited by 8
  6. 2013Generalized Thompson Sampling for Contextual Banditscited by 5
  7. 2017Auto-Encoding User Ratings via Knowledge Graphs in Recommendation Scenarioscited by 4
  8. 2018Beyond the Click-Through Rate: Web Link Selection with Multi-level Feedbackcited by 4
  9. 2020Collaborative Generative Hashing for Marketing and Fast Cold-start Recommendationcited by 2
  10. 2016A Theoretical Analysis of Two-Stage Recommendation for Cold-Start Collaborative Filteringcited by 1
  11. 2020Scalable bundling via dense product embeddingscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.