A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits
Liu Leqi, Giulio Zhou, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery
Abstract
Personalized recommender systems suffuse modern life, shaping what media we read and what products we consume. Algorithms powering such systems tend to consist of supervised-learning-based heuristics, such as latent factor models with a variety of heuristically chosen prediction targets. Meanwhile, theoretical treatments of recommendation frequently address the decision-theoretic nature of the problem, including the need to balance exploration and exploitation, via the multi-armed bandits (MABs) framework. However, MAB-based approaches rely heavily on assumptions about human preferences. These preference assumptions are seldom tested using human subject studies, partly due to the lack of publicly available toolkits to conduct such studies. In this work, we conduct a study with crowdworkers in a comics recommendation MABs setting. Each arm represents a comic category, and users provide feedback after each recommendation. We check the validity of core MABs assumptions—that human preferences (reward distributions) are fixed over time—and find that they do not hold. This finding suggests that any MAB algorithm used for recommender systems should account for human preference dynamics. While answering these questions, we provide a flexible experimental framework for understanding human preference dynamics and testing MABs algorithms with human users. The code for our experimental framework and the collected data can be found at https://github.com/HumainLab/human-bandit-evaluation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9000ef23-2bdb-449a-87f1-b09338e5994cCited by top-tier papers1
Ask how each one uses itBuilds on1
Related papers
- Non-Stationary Bandits with Auto-Regressive Temporal DependencyQinyi Chen, Negin Golrezaei, Djallel BouneffoufNeurIPS 2023 · 20 citations
- Local Clustering in Contextual Multi-Armed BanditsYikun Ban, Jingrui HeWWW 2021 · 51 citations
- Learning from Cross-Modal Behavior Dynamics with Graph-Regularized Neural Contextual BanditXian Wu, Suleyman Cetintas, Deguang Kong, Miao Lu et al.WWW 2020 · 8 citations
- Provably Efficient Multi-Objective Bandit Algorithms Under Preference-Centric CustomizationLinfeng Cao, Ming Shi, Ness B. ShroffAAAI 2026 · 2 citations
- Learning with Exposure Constraints in Recommendation SystemsOmer Ben-Porat, Rotem TorkanWWW 2023 · 16 citations
