( en | de | ru )

 

Disambiguation of "Bubeck, Sébastien"

Author of the publication

copydeleteadd this publication to your clipboard
On Finding the Largest Mean Among Many.

, , , and . CoRR, (2013)

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.

Sébastien Beyou

Sébastien Tixeuil

Sébastien Lallé

Sébastien Carcanague

Sébastien Choplin

 

Other publications of authors with the same name

Bounded regret in stochastic multi-armed bandits., , and . COLT, volume 30 of JMLR Workshop and Conference Proceedings, page 122-134. JMLR.org, (2013)Near-optimal method for highly smooth convex optimization., , , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 492-507. PMLR, (2019)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)Convex Optimization: Algorithms and Complexity. (2015)cite arxiv:1405.4980Comment: A previous version of the manuscript was titled "Theory of Convex Optimization for Machine Learning".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)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)Conference on Learning Theory 2018: Preface., and . COLT, volume 75 of Proceedings of Machine Learning Research, page 1. PMLR, (2018)