Sebastien Bubeck
Sebastien Bubeck
Sr Principal Researcher, Microsoft Research
Verified email at microsoft.com - Homepage
Title
Cited by
Cited by
Year
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
S Bubeck, N Cesa-Bianchi
Foundations and Trends in Machine Learning 5, 1-122, 2012
18142012
Convex optimization: Algorithms and complexity
S Bubeck
Foundations and Trends in Machine Learning 8, 231-357, 2014
902*2014
X-armed bandits
S Bubeck, R Munos, G Stoltz, C Szepesvári
Journal of Machine Learning Research 12, 1587-1627, 2011
496*2011
Online optimization in X-armed bandits
S Bubeck, R Munos, G Stoltz, C Szepesvári
NIPS 2008, 2008
4962008
Best arm identification in multi-armed bandits
JY Audibert, S Bubeck, R Munos
COLT 2010, 2010
4782010
Pure exploration in multi-armed bandits problems
S Bubeck, R Munos, G Stoltz
Algorithmic Learning Theory, 23-37, 2009
3362009
Minimax policies for adversarial and stochastic bandits
JY Audibert, S Bubeck
COLT 2009, 2009
3032009
lil'UCB: An Optimal Exploration Algorithm for Multi-Armed Bandits
K Jamieson, M Malloy, R Nowak, S Bubeck
COLT 2014, 2013
2352013
Regret bounds and minimax policies under partial monitoring
JY Audibert, S Bubeck
The Journal of Machine Learning Research 11, 2635-2686, 2010
1842010
Pure exploration in finitely-armed and continuous-armed bandits
S Bubeck, R Munos, G Stoltz
Theoretical Computer Science 412, 1832-1852, 2010
1792010
Regret in online combinatorial optimization
JY Audibert, S Bubeck, G Lugosi
Mathematics of Operations Research 39 (1), 31-45, 2014
1652014
Is Q-learning provably efficient?
C Jin, Z Allen-Zhu, S Bubeck, MI Jordan
Advances in Neural Information Processing Systems, 4863-4873, 2018
1562018
Multiple identifications in multi-armed bandits
S Bubeck, T Wang, N Viswanathan
ICML 2012, 2012
1462012
Optimal algorithms for smooth and strongly convex distributed optimization in networks
K Scaman, F Bach, S Bubeck, YT Lee, L Massoulié
arXiv preprint arXiv:1702.08704, 2017
1352017
Bandits with heavy tail
S Bubeck, N Cesa-Bianchi, G Lugosi
IEEE Transactions on Information Theory 59 (11), 7711-7717, 2013
1342013
The best of both worlds: Stochastic and adversarial bandits
S Bubeck, A Slivkins
COLT 2012, 2012
1222012
A geometric alternative to Nesterov's accelerated gradient descent
S Bubeck, YT Lee, M Singh
arXiv preprint arXiv:1506.08187, 2015
1072015
Introduction to online optimization
S Bubeck
Lecture Notes 2, 2011
932011
Adversarial examples from computational constraints
S Bubeck, YT Lee, E Price, I Razenshteyn
International Conference on Machine Learning, 831-840, 2019
902019
Sampling from a log-concave distribution with projected langevin monte carlo
S Bubeck, R Eldan, J Lehec
Discrete & Computational Geometry 59 (4), 757-783, 2018
85*2018
The system can't perform the operation now. Try again later.
Articles 1–20