← Search

Tomas Vaskevicius

3 accepted papers

2020

The Statistical Complexity of Early-Stopped Mirror Descent

NeurIPS 2020spotlight

Recently there has been a surge of interest in understanding implicit regularization properties of iterative gradient-based optimization algorithms. In this paper, we study the statistical guarantees on the excess risk achieved by early-stopped unconstrained mirror descent algorithms applied to the…

Cited by 28Source ↗PDF ↗Scholar ↗
2019

Implicit Regularization for Optimal Sparse Recovery

NeurIPS 2019poster

We investigate implicit regularization schemes for gradient descent methods applied to unpenalized least squares regression to solve the problem of reconstructing a sparse signal from an underdetermined system of linear measurements under the restricted isometry assumption. For a given parametrizati…