paper-with-me

Papers

L4: Practical loss-based stepsize adaptation for deep learning

2018-02-14 · NeurIPS 2018 12 · Michal Rolinek, Georg Martius

We propose a stepsize adaptation scheme for stochastic gradient descent. It operates directly with the loss function and rescales the gradient in order to make fixed predicted progress on the loss. We demonstrate its capabilities by conclusively improving the performance of Adam and Momentum optimizers. The enhanced optimizers with default hyperparameters consistently outperform their constant stepsize counterparts, even the best ones, without a measurable increase in computational cost. The performance is validated on multiple architectures including dense nets, CNNs, ResNets, and the recurrent Differential Neural Computer on classical datasets MNIST, fashion MNIST, CIFAR10 and others.

📄 PDF Abstract BibTeX arXiv:1802.05074

Code (2)

iovdin/l4-pytorch pytorch
martius-lab/l4-optimizer tf

Tasks

Deep Learning

Methods 이 논문이 사용한 방법론

Adam 설명 없음

Similar Papers 제목 키워드 기반

AdaGrad-Diff: A New Version of the Adaptive Gradient Algorithm

2026-02-13 · Matia Bojovic, Saverio Salzo, Massimiliano Pontil arxiv

Vanilla gradient methods are often highly sensitive to the choice of stepsize, which typically requires manual tuning. Adaptive methods alleviate this issue and have therefore become widely used. Among them, AdaGrad has …

Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency

2024-02-24 · Jingfeng Wu, Peter L. Bartlett, Matus Telgarsky, Bin Yu

We consider gradient descent (GD) with a constant stepsize applied to logistic regression with linearly separable data, where the constant stepsize $\eta$ is so large that the loss initially oscillates. We show that GD e…

General Classification

New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results

2025-05-26 · Francesco Orabona, Ryan D'Orazio

The Polyak stepsize has been proven to be a fundamental stepsize in convex optimization, giving near optimal gradient descent rates across a wide range of assumptions. The universality of the Polyak stepsize has also ins…

Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent

2025-02-16 · Ya-Chi Chu, Wenzhi Gao, Yinyu Ye, Madeleine Udell

This paper investigates the convergence properties of the hypergradient descent method (HDM), a 25-year-old heuristic originally proposed for adaptive stepsize selection in stochastic first-order methods. We provide the …

Adaptive Optimization Algorithms for Machine Learning

2023-11-16 · Slavomír Hanzely

Machine learning assumes a pivotal role in our data-driven world. The increasing scale of models and datasets necessitates quick and reliable algorithms for model training. This dissertation investigates adaptivity in ma…

Meta-LearningSecond-order methods