ZENITH: Automated Gradient Norm Informed Stochastic Optimization
Not on the map. Why?
Abstract (arXiv)
Training deep computer vision models requires manual oversight or hyperparameter tuning of the learning rate (LR) schedule. While existing adaptive optimizers schedule the LR automatically, they suffer from computational and memory overhead, incompatibility with regularization, and suboptimal LR choices. In this work, we introduce the ZENITH (Zero-overhead Evolution using Norm-Informed Training History) optimizer, which adapts the LR using the temporal evolution of the gradient norm. Image classification experiments spanning 6 CNN architectures and 6 benchmarks demonstrate that ZENITH achieves higher test accuracy in lower wall-clock time than baselines. It also yielded superior mAP in object detection, keypoint detection, and instance segmentation on MS COCO using the R-CNN family of models. Furthermore, its compatibility with regularization enables even better generalization.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 31 references that are in the map. First posted on arXiv 21 Jan 2026.
Builds on
22 of 31 references.
References · 22
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017Mask R-CNNcited by 7,259
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Deep Layer Aggregationcited by 436
- 2020Stochastic Polyak Step-size for SGD: An Adaptive Learning Rate for Fast Convergencecited by 137
10 more
- 2023Prodigy: An Expeditiously Adaptive Parameter-Free Learnercited by 129
- 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
- 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
- 2019The Step Decay Schedule: A Near Optimal, Geometrically Decaying Learning Rate Procedure For Least Squarescited by 67
- 2019Training Neural Networks for and by Interpolationcited by 45
- 2023DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Methodcited by 35
- 2018L4: Practical loss-based stepsize adaptation for deep learningcited by 26
- 2019Parabolic Approximation Line Search for DNNscited by 14
- 2024Gradient descent with generalized Newton's methodcited by 9
- 2023QLABGrad: a Hyperparameter-Free and Convergence-Guaranteed Scheme for Deep Learningcited by 6
Built on by
Not cited yet.