Randomness and Interpolation Improve Gradient Descent

Jiawen Li, Pascal Lefevre, Anwar Pp Abdul Majeed
10/14/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

Based on Stochastic Gradient Descent (SGD), the paper introduces two optimizers, named Interpolational Accelerating Gradient Descent (IAGD) as well as Noise-Regularized Stochastic Gradient Descent (NRSGD). IAGD leverages second-order Newton Interpolation to expedite the convergence process during training, assuming relevancy in gradients between iterations. To avoid over-fitting, NRSGD incorporates a noise regularization technique that introduces controlled noise to the gradients during the optimization process. Comparative experiments of this research are conducted on the CIFAR-10, and CIFAR-100 datasets, benchmarking different CNNs(Convolutional Neural Networks) with IAGD and NRSGD against classical optimizers in Keras Package. Results demonstrate the potential of those two viable improvement methods in SGD, implicating the effectiveness of the advancements.

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{li2025randomness,
  title  = {Randomness and Interpolation Improve Gradient Descent},
  author = {Jiawen Li and Pascal Lefevre and Anwar Pp Abdul Majeed},
  year   = {2025},
  eprint = {2510.13040},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.13040v1}
}

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/2510.13040.svg)](https://codeofpaper.com/paper/2510.13040)

Discussion