mlsanityData to 7 Oct 2026

Extending Open Bandit Pipeline to Simulate Industry Challenges

arXiv 2209.04147 ↗First posted 9 Sep 2022cs.LG cs.IRcited by 2

Not on the map. Why?

Abstract (arXiv)

Bandit algorithms are often used in the e-commerce industry to train Machine Learning (ML) systems when pre-labeled data is unavailable. However, the industry setting poses various challenges that make implementing bandit algorithms in practice non-trivial. In this paper, we elaborate on the challenges of off-policy optimisation, delayed reward, concept drift, reward design, and business rules constraints that practitioners at Booking.com encounter when applying bandit algorithms. Our main contributions is an extension to the Open Bandit Pipeline (OBP) framework. We provide simulation components for some of the above-mentioned challenges to provide future practitioners, researchers, and educators with a resource to address challenges encountered in the e-commerce industry.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 24 of its 45 references that are in the map. First posted on arXiv 9 Sep 2022.

Builds on

24 of 45 references.

References · 24

  1. 2020Learning under Concept Drift: A Reviewcited by 470
  2. 2013Online Learning under Delayed Feedbackcited by 137
  3. 2019RecSim: A Configurable Simulation Platform for Recommender Systemscited by 91
  4. 2018Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learningcited by 80
  5. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  6. 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
  7. 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
  8. 2019Nonstochastic Multiarmed Bandits with Unrestricted Delayscited by 46
  9. 2021Stochastic Multi-Armed Bandits with Unrestricted Delay Distributionscited by 33
  10. 2019Addressing Delayed Feedback for Continuous Training with Neural Networks in CTR predictioncited by 25
  11. 2019Blocking Banditscited by 25
  12. 2016Combining policy gradient and Q-learningcited by 23
12 more
  1. 2020Unifying Online and Counterfactual Learning to Rankcited by 15
  2. 2020Bayesian Meta-Prior Learning Using Empirical Bayescited by 14
  3. 2019To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactionscited by 13
  4. 2020Contextual Blocking Banditscited by 11
  5. 2021A Map of Bandits for E-commercecited by 9
  6. 2021Contextual Bandit Applications in Customer Support Botcited by 7
  7. 2022Non-Stationary Dueling Banditscited by 7
  8. 2020Ballooning Multi-Armed Banditscited by 6
  9. 2021Simulations in Recommender Systems: An industry perspectivecited by 6
  10. 2021Machine Learning for Fraud Detection in E-Commerce: A Research Agendacited by 5
  11. 2020A Linear Bandit for Seasonal Environmentscited by 3
  12. 2020From Clicks to Conversions: Recommendation for long-term rewardcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 0; 2026: 1.

2 papers.