An Optimal Algorithm for Stochastic and Adversarial Bandits I: Tsallis-INF Has Square-Root Adversarial Pseudo-Regret and Logarithmic Pseudo-Regret Under a Self-Bounding ConstraintResearch Paper
A multi-armed bandit learner repeatedly chooses one of several actions, observes only the loss of the chosen action, and tries to perform nearly as well as a single fixed action selected in hindsight. Two common loss models make different demands on the learner. In a stochastic model, each arm has a stable mean loss and the learner can gradually distinguish…