Sébastien Bubeck

Senior Researcher

Machine Learning and Optimization, Microsoft Research, Redmond


Building 99, 2938

Redmond, WA 98052

sebubeck AT microsoft DOT com

Co-chair for COLT 2018.

Associate Editor for Mathematics of Operations Research.

Associate Editor for Mathematical Statistics and Learning (publisher: European Mathematical Society)

Steering committee member (elected) for COLT from 2014 to 2017.

I was co-general chair for COLT 2013, COLT 2014, and I was on the program committee for NIPS 2012, NIPS 2014, NIPS 2016, NIPS 2017, COLT 2013, COLT 2014, COLT 2015, COLT 2016, COLT 2017, ICML 2015, ICML 2016, ICML 2017, SODA 2017, Random 2017, ALT 2013, ALT 2014.

I am interested in a variety of topics in theoretical computer science and machine learning.

My best works have been around online decision making, with a couple of solutions to long-standing problems (minimax rate for multi-armed bandits at COLT 2009, best of both worlds for multi-armed bandits at COLT 2011, bandit convex optimization at COLT 2016/STOC 2017, progress on k-server and MTS at STOC 2017/SODA 2018, chasing convex bodies in 2019).

I also did a couple of works in convex optimization (entropic barrier at COLT 2015, optimal distributed rates at ICML 2017/NIPS 2018) and in network analysis (influence of the seed in preferential attachment graphs, and dimension estimation in random geometric graphs, both in Random Structures and Algorithms).

NEW: Chasing convex bodies competitively

With an extremely fun team of co-authors (Yin Tat Lee, Yuanzhi Li, Mark Sellke) we finally managed to obtain a competitive algorithm for chasing convex bodies (after a couple of years of infructuous attempts). We also obtained a rather complete picture of the nested version of the problem.

A regularization approach for k-server and metrical task systems with the multiscale entropy

With a fantastic team of co-authors (Michael Cohen, James R. Lee, Yin Tat Lee, Aleksander Madry) we improved the state of the art competitive ratio for k-server and metrical task systems by using the mirror descent algorithm. To learn more about it I recommend to first take a look at this [youtube video], then these 3 blog posts ([part 1], [part 2], [part 3]) and finally [the k-server paper] itself. The [MTS paper] is finally online too, and it is a great start to get into this line of work.

Polynomial-time algorithm for bandit convex optimization

From July 2014 to July 2016 with various co-authors at MSR we dedicated a lot of energy to bandit convex optimization. The end product is a new efficient algorithm. To learn more about it I recommend to first take a look at this [youtube video], then these 3 blog posts ([part 1], [part 2], [part 3]), and finally [the paper] itself.

Research Interests

  • machine learning

  • theoretical computer science

  • convex optimization

  • multi-armed bandits

  • online algorithms (in particular metrical task systems and k-server)

  • statistical network analysis, random graphs and random matrices

  • applications of information theory to learning, optimization, and probability