Evaluating Online Bandit Exploration In Large-Scale Recommender System
Not on the map. Why?
Abstract (arXiv)
Bandit learning has been an increasingly popular design choice for recommender system. Despite the strong interest in bandit learning from the community, there remains multiple bottlenecks that prevent many bandit learning approaches from productionalization. One major bottleneck is how to test the effectiveness of bandit algorithm with fairness and without data leakage. Different from supervised learning algorithms, bandit learning algorithms emphasize greatly on the data collection process through their explorative nature. Such explorative behavior may induce unfair evaluation in a classic A/B test setting. In this work, we apply upper confidence bound (UCB) to our large scale short video recommender system and present a test framework for the production bandit learning life-cycle with a new set of metrics. Extensive experiment results show that our experiment design is able to fairly evaluate the performance of bandit learning in the recommender system.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 11 of its 39 references that are in the map. First posted on arXiv 5 Apr 2023.
Builds on
11 of 39 references.
References · 11
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
- 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 176
- 2020Neural Contextual Bandits with Deep Representation and Shallow Explorationcited by 71
- 2017Multi-Task Learning for Contextual Banditscited by 47
- 2016On Context-Dependent Clustering of Banditscited by 43
- 2019AutoSeM: Automatic Task Selection and Mixing in Multi-Task Learningcited by 22
- 2015A Survey of Online Experiment Design with the Stochastic Multi-Armed Banditcited by 18
- 2021Deep Exploration for Recommendation Systemscited by 14
- 2020Comparison Lift: Bandit-based Experimentation System for Online Advertisingcited by 10
- 2019Recommendation System-based Upper Confidence Bound for Online Advertisingcited by 7
- 2019Online Evaluation of Audiences for Targeted Advertising via Bandit Experimentscited by 5
Built on by
Citing papers per year: 2023: 3; 2024: 1; 2025: 2; 2026: 1.
7 papers.
- 2023Scalable Neural Contextual Bandit for Recommender Systemscited by 12
- 2023Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learningcited by 6
- 2025Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?cited by 4
- 2023Tackling Interference Induced by Data Training Loops in A/B Tests: A Weighted Training Approachcited by 3
- 2024Uncertainty of Joint Neural Contextual Banditcited by 1
- 2025Accelerating Recommender Model ETL with a Streaming FPGA-GPU Dataflowcited by 0
- 2026Mixing Makes Markovian Contexts Cheap for Linear Banditscited by 0
- 2026Mixing Makes Markovian Contexts Cheap for Linear Bandits13 Mar 2026
- 2025Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?16 Jul 2025
- 2025Accelerating Recommender Model ETL with a Streaming FPGA-GPU Dataflow21 Jan 2025
- 2024Uncertainty of Joint Neural Contextual Bandit4 Jun 2024
- 2023Tackling Interference Induced by Data Training Loops in A/B Tests: A Weighted Training Approach26 Oct 2023
- 2023Scalable Neural Contextual Bandit for Recommender Systems26 Jun 2023
- 2023Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learning23 May 2023