Stochastic Bandits Robust to Adversarial Attacks

This paper investigates stochastic bandit algorithms that are robust to adversarial attacks, where an attacker can first observe the learner's action and then alter their reward observation. We study two cases of this model, with or without the knowledge of an attack budget C, defined as an upper bound of the summation of the difference between the actual and altered rewards. For both cases, we devise two types of algorithms with regret bounds having additive or multiplicative C dependence terms. For the known attack budget case, we prove our algorithms achieve the regret bound of O((K/∆) log T + KC) and Õ(√KTC) for the additive and multiplicative C terms, respectively, where K is the number of arms, T is the time horizon, ∆ is the gap between the expected rewards of the optimal arm and the second-best arm, and Õ hides the logarithmic factors. For the unknown case, we prove our algorithms achieve the regret bound of Õ(√KT + KC²) and Õ(KC√T) for the additive and multiplicative C terms, respectively. In addition to these upper bound results, we provide several lower bounds showing the tightness of our bounds and the optimality of our algorithms. These results delineate an intrinsic separation between the bandits with attacks and corruption models.