mlsanityData to 7 Oct 2026

QLABGrad: a Hyperparameter-Free and Convergence-Guaranteed Scheme for Deep Learning

arXiv 2302.00252 ↗First posted 1 Feb 2023cs.LG math.OCcited by 6

Not on the map. Why?

Abstract (arXiv)

The learning rate is a critical hyperparameter for deep learning tasks since it determines the extent to which the model parameters are updated during the learning course. However, the choice of learning rates typically depends on empirical judgment, which may not result in satisfactory outcomes without intensive try-and-error experiments. In this study, we propose a novel learning rate adaptation scheme called QLABGrad. Without any user-specified hyperparameter, QLABGrad automatically determines the learning rate by optimizing the Quadratic Loss Approximation-Based (QLAB) function for a given gradient descent direction, where only one extra forward propagation is required. We theoretically prove the convergence of QLABGrad with a smooth Lipschitz condition on the loss function. Experiment results on multiple architectures, including MLP, CNN, and ResNet, on MNIST, CIFAR10, and ImageNet datasets, demonstrate that QLABGrad outperforms various competing schemes for deep learning.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 8 of its 27 references that are in the map. First posted on arXiv 1 Feb 2023.

Builds on

8 of 27 references.

References · 8

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2021Convex optimizationcited by 2,479
  4. 2016An overview of gradient descent optimization algorithmscited by 1,021
  5. 2021Learning to Optimize: A Primer and A Benchmarkcited by 206
  6. 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 117
  7. 2019Escaping Saddle Points with Adaptive Gradient Methodscited by 34
  8. 2018L4: Practical loss-based stepsize adaptation for deep learningcited by 26

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 1; 2026: 1.

6 papers.