Practical Bandits: An Industry Perspective
Not on the map. Why?
Abstract (arXiv)
The bandit paradigm provides a unified modeling framework for problems that require decision-making under uncertainty. Because many business metrics can be viewed as rewards (a.k.a. utilities) that result from actions, bandit algorithms have seen a large and growing interest from industrial applications, such as search, recommendation and advertising. Indeed, with the bandit lens comes the promise of direct optimisation for the metrics we care about. Nevertheless, the road to successfully applying bandits in production is not an easy one. Even when the action space and rewards are well-defined, practitioners still need to make decisions regarding multi-arm or contextual approaches, on- or off-policy setups, delayed or immediate feedback, myopic or long-term optimisation, etc. To make matters worse, industrial platforms typically give rise to large action spaces in which existing approaches tend to break down. The research literature on these topics is broad and vast, but this can overwhelm practitioners, whose primary aim is to solve practical problems, and therefore need to decide on a specific instantiation or approach for each project. This tutorial will take a step towards filling that gap between the theory and practice of bandits. Our goal is to present a unified overview of the field and its existing terminology, concepts and algorithms -- with a focus on problems relevant to industry. We hope our industrial perspective will help future practitioners who wish to leverage the bandit paradigm for their application.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 18 of its 54 references that are in the map. First posted on arXiv 2 Feb 2023.
Builds on
18 of 54 references.
References · 18
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
- 2019Introduction to Multi-Armed Banditscited by 475
- 2016Optimal Best Arm Identification with Fixed Confidencecited by 233
- 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 155
- 2013lil' UCB : An Optimal Exploration Algorithm for Multi-Armed Banditscited by 148
- 2016Off-policy evaluation for slate recommendationcited by 102
- 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
- 2017Boltzmann Exploration Done Rightcited by 69
- 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 53
- 2021Stochastic Multi-Armed Bandits with Unrestricted Delay Distributionscited by 33
- 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
- 2019Addressing Delayed Feedback for Continuous Training with Neural Networks in CTR predictioncited by 25
6 more
- 2020Carousel Personalization in Music Streaming Apps with Contextual Banditscited by 25
- 2020Safe Exploration for Optimizing Contextual Banditscited by 14
- 2021A Map of Bandits for E-commercecited by 9
- 2021Top-k eXtreme Contextual Bandits with Arm Hierarchycited by 8
- 2019ViTOR: Learning to Rank Webpages Based on Visual Featurescited by 2
- 2022Extending Open Bandit Pipeline to Simulate Industry Challengescited by 2
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 3; 2026: 2.
9 papers.
- 2024Optimal Baseline Corrections for Off-Policy Contextual Banditscited by 13
- 2023Ad-load Balancing via Off-policy Learning in a Content Marketplacecited by 11
- 2024Multi-Objective Recommendation via Multivariate Policy Learningcited by 10
- 2024Delta-rm OPE: Off-Policy Estimation with Pairs of Policiescited by 9
- 2026Additive Control Variates Dominate Self-Normalisation in Off-Policy Evaluationcited by 2
- 2025Optimization of Epsilon-Greedy Explorationcited by 1
- 2025Counterfactual Inference under Thompson Samplingcited by 0
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluationcited by 0
- 2026Accelerating A/B-Tests with Counterfactual Estimation: Reducing Variance through Policy Overlapcited by 0
- 2026Accelerating A/B-Tests with Counterfactual Estimation: Reducing Variance through Policy Overlap16 Jul 2026
- 2026Additive Control Variates Dominate Self-Normalisation in Off-Policy Evaluation16 Feb 2026
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation24 Jul 2025
- 2025Optimization of Epsilon-Greedy Exploration3 Jun 2025
- 2025Counterfactual Inference under Thompson Sampling3 Apr 2025
- 2024Delta-rm OPE: Off-Policy Estimation with Pairs of Policies16 May 2024
- 2024Optimal Baseline Corrections for Off-Policy Contextual Bandits9 May 2024
- 2024Multi-Objective Recommendation via Multivariate Policy Learning3 May 2024
- 2023Ad-load Balancing via Off-policy Learning in a Content Marketplace19 Sep 2023