mlsanityData to 7 Oct 2026

Gravity Optimizer: a Kinematic Approach on Optimization in Deep Learning

arXiv 2101.09192 ↗First posted 22 Jan 2021cs.LG cs.AI math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

We introduce Gravity, another algorithm for gradient-based optimization. In this paper, we explain how our novel idea change parameters to reduce the deep learning model's loss. It has three intuitive hyper-parameters that the best values for them are proposed. Also, we propose an alternative to moving average. To compare the performance of the Gravity optimizer with two common optimizers, Adam and RMSProp, five standard datasets were trained on two VGGNet models with a batch size of 128 for 100 epochs. Gravity hyper-parameters did not need to be tuned for different models. As will be explained more in the paper, to investigate the direct impact of the optimizer itself on loss reduction no overfitting prevention technique was used. The obtained results show that the Gravity optimizer has more stable performance than Adam and RMSProp and gives greater values of validation accuracy for datasets with more output classes like CIFAR-100 (Fine).

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 43 references that are in the map. First posted on arXiv 22 Jan 2021.

Builds on

17 of 43 references.

References · 17

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  5. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  6. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
  7. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  8. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
  9. 2019On the Convergence of Adam and Beyondcited by 834
  10. 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
  11. 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 181
  12. 2019On Empirical Comparisons of Optimizers for Deep Learningcited by 99
5 more
  1. 2017Variants of RMSProp and Adagrad with Logarithmic Regret Boundscited by 50
  2. 2018Convergence guarantees for RMSProp and ADAM in non-convex optimization and an empirical comparison to Nesterov accelerationcited by 39
  3. 2019DeepOBS: A Deep Learning Optimizer Benchmark Suitecited by 37
  4. 2020A Comparison of Optimization Algorithms for Deep Learningcited by 23
  5. 2018Nostalgic Adam: Weighting more of the past gradients when designing the adaptive learning ratecited by 16

Built on by

Not cited yet.