Randomness and Interpolation Improve Gradient Descent
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 14 references that are in the map. First posted on arXiv 14 Oct 2025.
Builds on
2 of 14 references.
References · 2
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2023Toward Understanding Why Adam Converges Faster Than SGD for Transformerscited by 53
Built on by
Not cited yet.