Better Algorithms for Stochastic Bandits with Adversarial Corruptions.
Anupam GuptaTomer KorenKunal TalwarPublished in: COLT (2019)
Keyphrases
- learning algorithm
- graph theory
- data structure
- computational complexity
- significant improvement
- optimization problems
- computationally efficient
- data mining
- theoretical analysis
- combinatorial optimization
- times faster
- machine learning algorithms
- orders of magnitude
- computational efficiency
- markov random field
- nearest neighbor
- recently developed
- probability distribution
- stochastic search
- regret bounds