v1v2 (latest)

The Statistical Complexity of Early-Stopped Mirror Descent

1 February 2020

Papers citing "The Statistical Complexity of Early-Stopped Mirror Descent"

36 / 36 papers shown

Title
Optimization Insights into Deep Diagonal Linear Networks Hippolyte Labarrière C. Molinari Lorenzo Rosasco S. Villa Cristian Vega 173 1 0 21 Dec 2024
Exponential Tail Local Rademacher Complexity Risk Bounds Without the Bernstein Condition Varun Kanade Patrick Rebeschini Tomas Vaskevicius 71 10 0 23 Feb 2022
The Implicit Regularization of Stochastic Gradient Flow for Least Squares Alnur Ali Yan Sun Robert Tibshirani 70 77 0 17 Mar 2020
Reparameterizing Mirror Descent as Gradient Descent Ehsan Amid Manfred K. Warmuth OOD 38 3 0 24 Feb 2020
Implicit Regularization for Optimal Sparse Recovery Tomas Vaskevicius Varun Kanade Patrick Rebeschini 49 103 0 11 Sep 2019
Introduction to Online Convex Optimization Elad Hazan OffRL 178 1,939 0 07 Sep 2019
Fast-rate PAC-Bayes Generalization Bounds via Shifted Rademacher Processes Jun Yang Shengyang Sun Daniel M. Roy 50 28 0 20 Aug 2019
Kernel and Rich Regimes in Overparametrized Models Blake E. Woodworth Suriya Gunasekar Pedro H. P. Savarese E. Moroshko Itay Golan Jason D. Lee Daniel Soudry Nathan Srebro 80 366 0 13 Jun 2019
Implicit Regularization in Deep Matrix Factorization Sanjeev Arora Nadav Cohen Wei Hu Yuping Luo AI4CE 87 509 0 31 May 2019
Implicit Regularization of Accelerated Methods in Hilbert Spaces Nicolò Pagliana Lorenzo Rosasco 61 18 0 30 May 2019
Optimal Statistical Rates for Decentralised Non-Parametric Regression with Linear Speed-Up Dominic Richards Patrick Rebeschini 32 13 0 08 May 2019
Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networks Gauthier Gidel Francis R. Bach Simon Lacoste-Julien AI4CE 70 155 0 30 Apr 2019
High-Dimensional Linear Regression via Implicit Regularization P. Zhao Yun Yang Qiaochu He 49 26 0 22 Mar 2019
Exponentiated Gradient Meets Gradient Descent Udaya Ghai Elad Hazan Y. Singer 73 47 0 05 Feb 2019
A Continuous-Time View of Early Stopping for Least Squares Alnur Ali J. Zico Kolter Robert Tibshirani 67 97 0 23 Oct 2018
Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent Dominic Richards Patrick Rebeschini 55 18 0 18 Sep 2018
Stochastic Gradient/Mirror Descent: Minimax Optimality and Implicit Regularization Navid Azizan B. Hassibi 48 63 0 04 Jun 2018
Stability and Convergence Trade-off of Iterative Optimization Algorithms Yuansi Chen Chi Jin Bin Yu 53 93 0 04 Apr 2018
Characterizing Implicit Bias in Terms of Optimization Geometry Suriya Gunasekar Jason D. Lee Daniel Soudry Nathan Srebro AI4CE 73 411 0 22 Feb 2018
Iterate averaging as regularization for stochastic gradient descent Gergely Neu Lorenzo Rosasco MoMe 76 61 0 22 Feb 2018
Extending the scope of the small-ball method S. Mendelson 41 6 0 04 Sep 2017
Don't relax: early stopping for convex regularization Simon Matet Lorenzo Rosasco S. Villa Bang Long Vu 60 19 0 18 Jul 2017
Early stopping for kernel boosting algorithms: A general analysis with localized complexities Yuting Wei Fanny Yang Martin J. Wainwright 66 77 0 05 Jul 2017
Implicit Regularization in Matrix Factorization Suriya Gunasekar Blake E. Woodworth Srinadh Bhojanapalli Behnam Neyshabur Nathan Srebro 79 493 0 25 May 2017
Risk minimization by median-of-means tournaments Gabor Lugosi S. Mendelson 118 132 0 02 Aug 2016
Convergence rates of Kernel Conjugate Gradient for random design regression Gilles Blanchard Nicole E. Kramer 53 38 0 08 Jul 2016
Localization of VC Classes: Beyond Local Rademacher Complexities Nikita Zhivotovskiy Steve Hanneke 91 32 0 02 Jun 2016
Generalization Properties and Implicit Regularization for Multiple Passes SGM Junhong Lin Raffaello Camoriano Lorenzo Rosasco 63 70 0 26 May 2016
Train faster, generalize better: Stability of stochastic gradient descent Moritz Hardt Benjamin Recht Y. Singer 116 1,243 0 03 Sep 2015
Iterative Regularization for Learning with Convex Loss Functions Junhong Lin Lorenzo Rosasco Ding-Xuan Zhou 72 43 0 31 Mar 2015
Learning with Square Loss: Localization through Offset Rademacher Complexity Tengyuan Liang Alexander Rakhlin Karthik Sridharan 74 75 0 21 Feb 2015
The Sample Complexity of Learning Linear Predictors with the Squared Loss Ohad Shamir 66 41 0 19 Jun 2014
Online Nonparametric Regression Alexander Rakhlin Karthik Sridharan 177 101 0 11 Feb 2014
Learning without Concentration S. Mendelson 229 334 0 01 Jan 2014
Early stopping and non-parametric regression: An optimal data-dependent stopping rule Garvesh Raskutti Martin J. Wainwright Bin Yu 119 299 0 15 Jun 2013
$Minimax rates of estimation for high-dimensional linear regression over $\ell_q$-balls$ Minimax rates of estimation for high-dimensional linear regression over $\ell_q$ -balls Garvesh Raskutti Martin J. Wainwright Bin Yu 220 575 0 11 Oct 2009