New logarithmic step size for stochastic gradient descent
M. Soheil Shamaee, S. Fathi Hafshejani, Z. Saeidian
TL;DR
The paper addresses SGD step-size design in the context of non-convex objectives by introducing a novel logarithmic step size with warm restarts, defined as $\eta_t=\eta_0\left(1-\frac{\ln t}{\ln T}\right)$. The authors prove an $O\left(\frac{1}{\sqrt{T}}\right)$ convergence rate under smoothness assumptions when $c\propto\frac{\sqrt{T}}{\ln T}$ and provide a two-loop warm-restart algorithm to implement this schedule. Empirically, they compare against nine baselines on FashionMNIST, CIFAR10, and CIFAR100, reporting competitive training performance and a $0.9$ percentage-point improvement in test accuracy for CIFAR100 with CNN. The work highlights that the new step size preserves more probability mass for later iterations, improving final-output selection and overall effectiveness in deep learning benchmarks. These results suggest practical benefits for SGD-based training, particularly in deep CNNs on standard image datasets.
Abstract
In this paper, we propose a novel warm restart technique using a new logarithmic step size for the stochastic gradient descent (SGD) approach. For smooth and non-convex functions, we establish an $O(\frac{1}{\sqrt{T}})$ convergence rate for the SGD. We conduct a comprehensive implementation to demonstrate the efficiency of the newly proposed step size on the ~FashionMinst,~ CIFAR10, and CIFAR100 datasets. Moreover, we compare our results with nine other existing approaches and demonstrate that the new logarithmic step size improves test accuracy by $0.9\%$ for the CIFAR100 dataset when we utilize a convolutional neural network (CNN) model.
