Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation
Not on the map. Why?
Abstract (arXiv)
Multi-Armed Bandit (MAB) algorithms are widely used in recommender systems that require continuous, incremental learning. A core aspect of MABs is the exploration-exploitation trade-off: choosing between exploiting items likely to be enjoyed and exploring new ones to gather information. In contextual linear bandits, this trade-off is particularly central, as many variants share the same linear regression backbone and differ primarily in their exploration strategies. Despite its prevalent use, offline evaluation of MABs is increasingly recognized for its limitations in reliably assessing exploration behavior. This study conducts an extensive offline empirical comparison of several linear MABs. Strikingly, across over 90% of various datasets, a greedy linear model, with no type of exploration, consistently achieves top-tier performance, often outperforming or matching its exploratory counterparts. This observation is further corroborated by hyperparameter optimization, which consistently favors configurations that minimize exploration, suggesting that pure exploitation is the dominant strategy within these evaluation settings. Our results expose significant inadequacies in offline evaluation protocols for bandits, particularly concerning their capacity to reflect true exploratory efficacy. Consequently, this research underscores the urgent necessity for developing more robust assessment methodologies, guiding future investigations into alternative evaluation frameworks for interactive learning in recommender systems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 69 references that are in the map. First posted on arXiv 24 Jul 2025.
Builds on
21 of 69 references.
References · 21
- 2019Introduction to Multi-Armed Banditscited by 481
- 2018Offline A/B testing for Recommender Systemscited by 96
- 2019RecSim: A Configurable Simulation Platform for Recommender Systemscited by 94
- 2018Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learningcited by 80
- 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
- 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
- 2013A Gang of Banditscited by 49
- 2020Interactive Recommender System via Knowledge Graph-enhanced Reinforcement Learningcited by 40
- 2019Conversational Contextual Bandit: Algorithm and Applicationcited by 35
- 2018Offline Evaluation of Ranking Policies with Click Modelscited by 32
- 2023KuaiSim: A Comprehensive Simulator for Recommender Systemscited by 30
- 2021RecSim NG: Toward Principled Uncertainty Modeling for Recommender Ecosystemscited by 21
9 more
- 2020Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interestscited by 18
- 2020Knowledge-guided Deep Reinforcement Learning for Interactive Recommendationcited by 18
- 2020Digital Nudging with Recommender Systems: Survey and Future Directionscited by 17
- 2020Submodular Bandit Problem Under Multiple Constraintscited by 15
- 2021Deep Exploration for Recommendation Systemscited by 14
- 2024Optimal Baseline Corrections for Off-Policy Contextual Banditscited by 13
- 2023Practical Bandits: An Industry Perspectivecited by 9
- 2021Incentivizing Exploration in Linear Bandits under Information Gapcited by 5
- 2020Contextual Bandits for adapting to changing User preferences over timecited by 3
Built on by
Not cited yet.