Author of the publication

Sparsity, variance and curvature in multi-armed bandits.

, , and . ALT, volume 83 of Proceedings of Machine Learning Research, page 111-127. PMLR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Finding Adam in random growing trees., , and . Random Struct. Algorithms, 50 (2): 158-172 (2017)Testing for high-dimensional geometry in random graphs., , , and . CoRR, (2014)On Finding the Largest Mean Among Many., , , and . CoRR, (2013)Conference on Learning Theory 2018: Preface., and . COLT, volume 75 of Proceedings of Machine Learning Research, page 1. PMLR, (2018)Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits., , and . ICML, volume 80 of Proceedings of Machine Learning Research, page 186-194. PMLR, (2018)Pure Exploration in Multi-armed Bandits Problems., , and . ALT, volume 5809 of Lecture Notes in Computer Science, page 23-37. Springer, (2009)Bounded regret in stochastic multi-armed bandits., , and . COLT, volume 30 of JMLR Workshop and Conference Proceedings, page 122-134. JMLR.org, (2013)Local max-cut in smoothed polynomial time., , , and . STOC, page 429-437. ACM, (2017)Kernel-based methods for bandit convex optimization., , and . STOC, page 72-85. ACM, (2017)Near-optimal method for highly smooth convex optimization., , , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 492-507. PMLR, (2019)