Sign in

Better Algorithms for Stochastic Bandits with Adversarial Corruptions

By Anupam Gupta and others
We study the stochastic multi-armed bandits problem in the presence of adversarial corruption. We present a new algorithm for this problem whose regret is nearly optimal, substantially improving upon previous work. Our algorithm is agnostic to the level of adversarial contamination and can tolerate a significant amount of corruption with... Show more
March 28, 2019
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
Better Algorithms for Stochastic Bandits with Adversarial Corruptions
Click on play to start listening