Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses
arXiv:2603.26066v1 Announce Type: new
Abstract: We study a class of adversarial bandit optimization problems in which the loss functions may be non-convex and non-smooth. In each round, the learner observes a loss that consists of an underlying linear…