Choosing the Better Bandit Algorithm under Data Sharing: When Do A/B Experiments Work?
We study A/B experiments that are designed to compare the performance of two recommendation algorithms. Prior work has shown that the standard difference-in-means estimator is biased in estimating the global treatment effect (GTE) due to a particular form of interference between experimental units. Specifically, units under the treatment and control algorithms contribute to a shared pool of data that subsequently train both algorithms, resulting in interference between the two groups. The bias arising from this type of data sharing is known as "symbiosis bias". In this paper, we highlight that, for decision-making purposes, the sign of the GTE often matters more than its precise magnitude when selecting the better algorithm. We formalize this insight under a multi-armed bandit framework and theoretically characterize when the sign of the expected GTE estimate under data sharing aligns with or contradicts the sign of the true GTE. Our analysis identifies the level of exploration versus exploitation as a key determinant of how symbiosis bias impacts algorithm selection.
Code (1)
Similar Papers 제목 키워드 기반
No Regret Bound for Extreme Bandits
Algorithms for hyperparameter optimization abound, all of which work well under different and often unverifiable assumptions. Motivated by the general challenge of sequentially choosing which algorithm to use, we study t…
Hyperparameter OptimizationAn empirical evaluation of active inference in multi-armed bandits
A key feature of sequential decision making under uncertainty is a need to balance between exploiting--choosing the best action according to the current knowledge, and exploring--obtaining information about values of oth…
BIG-bench Machine LearningDecision MakingDecision Making Under UncertaintyMulti-Armed Bandits+2Greedy Algorithm almost Dominates in Smoothed Contextual Bandits
Online learning algorithms, widely used to power search and content optimization on the web, must balance exploration and exploitation, potentially sacrificing the experience of current users in order to gain information…
DiversityMulti-Armed BanditsUnreliable Multi-Armed Bandits: A Novel Approach to Recommendation Systems
We use a novel modification of Multi-Armed Bandits to create a new model for recommendation systems. We model the recommendation system as a bandit seeking to maximize reward by pulling on arms with unknown rewards. The …
Multi-Armed BanditsRecommendation SystemsContextual Bandits with Cross-learning
In the classical contextual bandits problem, in each round $t$, a learner observes some context $c$, chooses some action $i$ to perform, and receives some reward $r_{i,t}(c)$. We consider the variant of this problem wher…
Multi-Armed Bandits