Adversarial Online Learning with noise

10/22/2018
by   Alon Resler, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2016

Online Learning with Feedback Graphs Without the Graphs

We study an online learning framework introduced by Mannor and Shamir (2...
research
11/18/2015

Online learning in repeated auctions

Motivated by online advertising auctions, we consider repeated Vickrey a...
research
06/04/2013

Online Learning under Delayed Feedback

Online learning with delayed feedback has received increasing attention ...
research
11/25/2018

Online Newton Step Algorithm with Estimated Gradient

Online learning with limited information feedback (bandit) tries to solv...
research
11/03/2017

Learning to Bid Without Knowing your Value

We address online learning in complex auction settings, such as sponsore...
research
07/18/2022

Online Learning with Off-Policy Feedback

We study the problem of online learning in adversarial bandit problems u...
research
03/01/2019

Regret Minimisation in Multinomial Logit Bandits

We consider two regret minimisation problems over subsets of a finite gr...

Please sign up or login with your details

Forgot password? Click here to reset