New logarithmic step size for stochastic gradient descent

M. Soheil Shamaee, S. Fathi Hafshejani, Z. Saeidian
4/1/2024
cs.LGmath.OC

No confident code implementation found for this paper.

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{shamaee2024logarithmic,
  title  = {New logarithmic step size for stochastic gradient descent},
  author = {M. Soheil Shamaee and S. Fathi Hafshejani and Z. Saeidian},
  year   = {2024},
  eprint = {2404.01257},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2404.01257v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2404.01257.svg)](https://codeofpaper.com/paper/2404.01257)

Discussion