57 citations · 57 across the 1 of their papers we have counts for
6 papers
k-server via multiscale entropic regularization
Sebastien Bubeck, Michael B. Cohen, James R. Lee +2
We present an -competitive randomized algorithm for the -server problem on hierarchically separated trees (HSTs). This is the first -competitive randomized…
Sparsity, variance and curvature in multi-armed bandits
Sébastien Bubeck, Michael B. Cohen, Yuanzhi Li
In (online) learning theory the concepts of sparsity, variance and curvature are well-understood and are routinely used to obtain refined regret and generalization bounds. In this…
Geometric Median in Nearly Linear Time
Michael B. Cohen, Yin Tat Lee, Gary Miller +2
In this paper we provide faster algorithms for solving the geometric median problem: given points in compute a point that minimizes the sum of Euclidean distan…
Online Row Sampling
Michael B. Cohen, Cameron Musco, Jakub Pachocki
Finding a small spectral approximation for a tall matrix is a fundamental numerical primitive. For a number of reasons, one often seeks an approximation whose rows…
Ramanujan Graphs in Polynomial Time
Michael B. Cohen
The recent work by Marcus, Spielman and Srivastava proves the existence of bipartite Ramanujan (multi)graphs of all degrees and all sizes. However, that paper did not provide a pol…
Approximating Nearest Neighbor Distances
Michael B. Cohen, Brittany Terese Fasy, Gary L. Miller +3
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes t…