mlsanityData to 14 Oct 2026

Challenges and Solutions for Bandits in the Wild: Warm-Started Mixture Bandits for Cross-Cohort Slate Recommendation

arXiv 2609.37800 ↗First posted 29 Sep 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Many recommender services repeatedly encounter cold-start cohorts, where new users arrive with little or no interaction history. This creates two challenges: learning user preferences quickly from limited feedback and sustaining useful recommendations when each user has a finite catalog that can become repetitive or depleted over time. We propose CohortMix-TS, a warm-started mixture bandit that learns latent user groups from earlier cohorts and uses available metadata to construct group-informed priors for new users. Starting from these fixed priors, the model personalizes independently as feedback from each user becomes available. Session slates combine Thompson sampling with diversity and inventory-depletion controls. We evaluate CohortMix-TS through simulation, semi-synthetic experiments, and a 25-day randomized in-the-wild deployment with 713 registered participants in a Campus Games quiz application. Our evaluations show that cross-cohort transfer improves early recommendation quality and user-level regret, while inventory-aware slate construction helps prevent premature exhaustion of preferred items. In the field deployment, treatment users also showed a larger early-to-late change in correctness than users receiving random recommendations. Together, these results show how warm-start transfer and inventory-aware recommendations can support personalization for short-lived, repeatedly cold-starting cohorts.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 46 references that are in the map. First posted on arXiv 29 Sep 2026.

Builds on

11 of 46 references.

References · 11

  1. 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 248
  2. 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
  3. 2020Towards an Appropriate Query, Key, and Value Computation for Knowledge Tracingcited by 81
  4. 2017Rotting Banditscited by 57
  5. 2021Hierarchical Bayesian Banditscited by 35
  6. 2021Batched Thompson Samplingcited by 19
  7. 2020Fast Distributed Bandits for Online Recommendation Systemscited by 18
  8. 2020Contextual User Browsing Bandits for Large-Scale Online Mobile Recommendationcited by 8
  9. 2023MobileRec: A Large-Scale Dataset for Mobile Apps Recommendationcited by 8
  10. 2021Dynamic Slate Recommendation with Gated Recurrent Units and Thompson Samplingcited by 5
  11. 2022Dynamic collaborative filtering Thompson Sampling for cross-domain advertisements recommendationcited by 1

Built on by

Not cited yet.