mlsanityData to 14 Oct 2026

Training With Data Dependent Dynamic Learning Rates

arXiv 2105.13464 ↗First posted 27 May 2021cs.LG cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Recently many first and second order variants of SGD have been proposed to facilitate training of Deep Neural Networks (DNNs). A common limitation of these works stem from the fact that they use the same learning rate across all instances present in the dataset. This setting is widely adopted under the assumption that loss functions for each instance are similar in nature, and hence, a common learning rate can be used. In this work, we relax this assumption and propose an optimization framework which accounts for difference in loss function characteristics across instances. More specifically, our optimizer learns a dynamic learning rate for each instance present in the dataset. Learning a dynamic learning rate for each instance allows our optimization framework to focus on different modes of training data during optimization. When applied to an image classification task, across different CNN architectures, learning dynamic learning rates leads to consistent gains over standard optimizers. When applied to a dataset containing corrupt instances, our framework reduces the learning rates on noisy instances, and improves over the state-of-the-art. Finally, we show that our optimization framework can be used for personalization of a machine learning model towards a known targeted data distribution.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 40 references that are in the map. First posted on arXiv 27 May 2021.

Builds on

23 of 40 references.

References · 23

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,059
  5. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  6. 2018Learning to Reweight Examples for Robust Deep Learningcited by 675
  7. 2017MentorNet: Learning Data-Driven Curriculum for Very Deep Neural Networks on Corrupted Labelscited by 653
  8. 2016Learning to learn by gradient descent by gradient descentcited by 620
  9. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 360
  10. 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
  11. 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 328
  12. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
11 more
  1. 2019On The Power of Curriculum Learning in Training Deep Networkscited by 286
  2. 2017A General and Adaptive Robust Loss Functioncited by 236
  3. 2018Three Mechanisms of Weight Decay Regularizationcited by 113
  4. 2019Accelerating Deep Learning by Focusing on the Biggest Loserscited by 94
  5. 2018Norm matters: efficient and accurate normalization schemes in deep networkscited by 62
  6. 2019Time Matters in Regularizing Deep Networks: Weight Decay and Data Augmentation Affect Early Learning Dynamics, Matter Little Near Convergencecited by 54
  7. 2018On the insufficiency of existing momentum schemes for Stochastic Optimizationcited by 49
  8. 2018On the Ineffectiveness of Variance Reduced Optimization for Deep Learningcited by 48
  9. 2019Optimizing Data Usage via Differentiable Rewardscited by 48
  10. 2016Self-Paced Learning: an Implicit Regularization Perspectivecited by 21
  11. 2018Personalizing deep learning models for automatic sleep stagingcited by 8

Built on by

Not cited yet.