130 citations · 209 across the 59 of their papers we have counts for
4 papers · 1 filter
Vertex Sparsifiers for c-Edge Connectivity
Yang P. Liu, Richard Peng, Mark Sellke
We show the existence of O(f(c)k) sized vertex sparsifiers that preserve all edge-connectivity values up to c between a set of k terminal vertices, where f(c) is a function that on…
Chasing Convex Bodies Optimally
Mark Sellke
In the chasing convex bodies problem, an online player receives a request sequence of convex sets contained in a normed space . The player starts…
Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without
Sébastien Bubeck, Yuanzhi Li, Yuval Peres +1
We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem. The model assumes no communication at all between the players, and furthermore…
First-Order Bayesian Regret Analysis of Thompson Sampling
Sébastien Bubeck, Mark Sellke
We address online combinatorial optimization when the player has a prior over the adversary's sequence of losses. In this framework, Russo and Van Roy proposed an information-theor…