Learning rate decay can exponentially speed SGD on some nonconvex functions
Authors prove a benchmark class where decay uses exponentially fewer gradient queries than any fixed small step size.
5 stories, newest first · one card per story
Authors prove a benchmark class where decay uses exponentially fewer gradient queries than any fixed small step size.
Theory paper shows SGD drives undercomplete linear autoencoders toward large decoder weights along the PCA solution manifold until hitting a finite-stepsize stability boundary.
Paper proves a sharp Gaussian approximation for the stationary law of constant-stepsize SGD.
A statistical mechanics analysis explains double descent: finite-time diffusion induces effective weight decay that regularizes models as parameters grow.
Quantile-k-Loss SGD filters corrupted component losses by quantile sampling, proving linear convergence while outperforming standard and min-k-loss SGD.
Today 1.6K readers · 2.4K views · 775 reads · all time 189K views