ExpTest: Loss-Curve Hypothesis Testing for Autonomous Learning-Rate Selection in Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
Hyperparameter tuning remains a significant challenge in the training of deep neural networks (DNNs), requiring manual search or time-intensive grid searches that increase resource costs and limit the accessibility of machine learning. The global initial learning rate is among the most consequential of these hyperparameters. Adaptive and scheduling-based methods manage the learning rate during training but still require manual selection of an initial global value; learning-rate-free alternatives remove this selection at the cost of performance or stability on non-convex problems. We present ExpTest, an autonomous learning-rate controller that treats the training loss curve as an online signal and performs sequential statistical tests on theoretically motivated windows to detect convergent behavior and trigger learning-rate reductions. The framework combines a covariance-based initial learning-rate estimate, curvature-motivated window sizing, and two-phase test-driven decay, drawing on the approximately exponential decay behavior predicted under linearized network dynamics. We provide a mathematical motivation for ExpTest and evaluate it on regression, classification, forecasting, and natural-language tasks across fully-connected, convolutional, transformer-based, and pretrained architectures. Across these tasks, ExpTest achieves competitive performance relative to hand-tuned SGD-based baselines and recent learning-rate-free methods, without manual initial learning-rate selection or predefined scheduling.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 52 references that are in the map. First posted on arXiv 25 Nov 2024.
Builds on
32 of 52 references.
References · 32
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
20 more
- 2015Cyclical Learning Rates for Training Neural Networkscited by 629
- 2020On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselinescited by 255
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2018A disciplined approach to neural network hyper-parameters: Part 1 -- learning rate, batch size, momentum, and weight decaycited by 226
- 2020The large learning rate phase of deep learning: the catapult mechanismcited by 216
- 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 215
- 2018A Convergence Analysis of Gradient Descent for Deep Linear Neural Networkscited by 184
- 2020Implicit Gradient Regularizationcited by 146
- 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
- 2023Prodigy: An Expeditiously Adaptive Parameter-Free Learnercited by 133
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 118
- 2020Hyper-Parameter Optimization: A Review of Algorithms and Applicationscited by 114
- 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
- 2017Implicit Regularization in Deep Learningcited by 90
- 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
- 2021The Shape of Learning Curves: a Reviewcited by 70
- 2021What can linearized neural networks actually say about generalization?cited by 49
- 2023Six Lectures on Linearized Neural Networkscited by 20
- 2018Depth with Nonlinearity Creates No Bad Local Minima in ResNetscited by 17
- 2022Maximal Initial Learning Rates in Deep ReLU Networkscited by 11
Built on by
Not cited yet.