Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack
Robust Stochastic Bandit Algorithms under Probabilistic Unbounded Adversarial Attack
The multi-armed bandit formalism has been extensively studied under various attack models, in which an adversary can modify the reward revealed to the player. Previous studies focused on scenarios where the attack value either is bounded at each round or has a vanishing probability of occurrence. These models do not …