Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits

Abstract

We propose a bandit algorithm that explores by randomizing its history of rewards. Specifically, it pulls the arm with the highest mean reward in a non-parametric bootstrap sample of its history with pseudo rewards. We design the pseudo rewards such that the bootstrap mean is optimistic with a sufficiently high probability. We call our algorithm Giro, which stands for garbage in, reward out. We analyze Giro in a Bernoulli bandit and derive a $O(K{\Delta }^{-1}\log n)$ bound on its $n$-round regret, where $\Delta$ is the difference in the expected rewards of the optimal and the best suboptimal arms, and $K$ is the number of arms. The main advantage of our exploration design is that it easily generalizes to structured problems. To show this, we propose contextual Giro with an arbitrary reward generalization model. We evaluate Giro and its contextual variant on multiple synthetic and real-world problems, and observe that it performs well.

arXiv commentProceedings of the 36th International Conference on Machine Learning

References in corpus (11)

• Scikit-learn: Machine Learning in Python
• A Contextual-Bandit Approach to Personalized News Article Recommendation
• Thompson Sampling for Contextual Bandits with Linear Payoffs
• Further Optimal Regret Bounds for Thompson Sampling
• Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits
• Provably Optimal Algorithms for Generalized Linear Contextual Bandits
• Bootstrapped Thompson Sampling and Deep Exploration
• Ensemble Sampling
• Online Stochastic Linear Optimization under One-bit Feedback
• Thompson sampling with the online bootstrap
• New Insights into Bootstrapping for Bandits