Adversarial Online Learning with noise

We present and study models of adversarial online learning where the feedback observed by the learner is noisy, and the feedback is either full information feedback or bandit feedback. Specifically, we consider binary losses xored with the noise, which is a Bernoulli random variable. We consider both a constant noise rate and a variable noise rate. Our main results are tight regret bounds for leaning with noise in the adversarial online learning model.

• Machine Intelligence

• Algorithms and Theory