
Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration
We show that standard extragradient methods (i.e. mirror prox and dual e...
read it

A nearoptimal algorithm for approximating the John Ellipsoid
We develop a simple and efficient algorithm for approximating the John E...
read it

Solving Directed Laplacian Systems in NearlyLinear Time through Sparse LU Factorizations
We show how to solve directed Laplacian systems in nearlylinear time. G...
read it

Solving Linear Programs in the Current Matrix Multiplication Time
This paper shows how to solve linear programs of the form _Ax=b,x≥0 c^ x...
read it

Constant Arboricity Spectral Sparsifiers
We show that every graph is spectrally similar to the union of a constan...
read it

Metrical task systems on trees via mirror descent and unfair gluing
We consider metrical task systems on tree metrics, and present an O(dept...
read it

A NearlyLinear Bound for Chasing Nested Convex Bodies
Friedman and Linial introduced the convex body chasing problem to explor...
read it

On Acceleration with NoiseCorrupted Gradients
Accelerated algorithms have broad applications in largescale optimizati...
read it

An homotopy method for ℓ_p regression provably beyond selfconcordance and in inputsparsity time
We consider the problem of linear regression where the ℓ_2^n norm loss (...
read it

kserver via multiscale entropic regularization
We present an O(( k)^2)competitive randomized algorithm for the kserve...
read it

Optimal approximate matrix product in terms of stable rank
We prove, using the subspace embedding guarantee in a black box way, tha...
read it
Michael B. Cohen
is this you? claim profile