research
∙
11/12/2020
Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration
We show that standard extragradient methods (i.e. mirror prox and dual e...
share
research
∙
05/28/2019
A near-optimal algorithm for approximating the John Ellipsoid
We develop a simple and efficient algorithm for approximating the John E...
research
∙
11/26/2018
Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations
We show how to solve directed Laplacian systems in nearly-linear time. G...
research
∙
10/18/2018
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...
research
∙
08/16/2018
Constant Arboricity Spectral Sparsifiers
We show that every graph is spectrally similar to the union of a constan...
research
∙
07/12/2018
Metrical task systems on trees via mirror descent and unfair gluing
We consider metrical task systems on tree metrics, and present an O(dept...
research
∙
06/22/2018
A Nearly-Linear Bound for Chasing Nested Convex Bodies
Friedman and Linial introduced the convex body chasing problem to explor...
research
∙
05/31/2018
On Acceleration with Noise-Corrupted Gradients
Accelerated algorithms have broad applications in large-scale optimizati...
research
∙
11/03/2017
An homotopy method for â„“_p regression provably beyond self-concordance and in input-sparsity time
We consider the problem of linear regression where the â„“_2^n norm loss (...
research
∙
11/03/2017
k-server via multiscale entropic regularization
We present an O(( k)^2)-competitive randomized algorithm for the k-serve...
research
∙
07/08/2015
