261 citations · 1.4k across the 45 of their papers we have counts for
4 papers · 1 filter
Local max-cut in smoothed polynomial time
Omer Angel, Sébastien Bubeck, Yuval Peres +1
In 1988, Johnson, Papadimitriou and Yannakakis wrote that "Practically all the empirical evidence would lead us to conclude that finding locally optimal solutions is much easier th…
Basic models and questions in statistical network analysis
Miklos Z. Racz, Sébastien Bubeck
Extracting information from large graphs has become an important statistical problem since network data is now common in various fields. In this minicourse we will investigate the…
Kernel-based methods for bandit convex optimization
Sébastien Bubeck, Ronen Eldan, Yin Tat Lee
We consider the adversarial convex bandit problem and we build the first -time algorithm with -regret for this problem. To do so we int…
Black-box optimization with a politician
Sébastien Bubeck, Yin-Tat Lee
We propose a new framework for black-box convex optimization which is well-suited for situations where gradient computations are expensive. We derive a new method for this framewor…