mlsanityData to 14 Oct 2026

Tilting the playing field: Dynamical loss functions for machine learning

arXiv 2102.03793 ↗First posted 7 Feb 2021cs.LG cond-mat.soft stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

We show that learning can be improved by using loss functions that evolve cyclically during training to emphasize one class at a time. In underparameterized networks, such dynamical loss functions can lead to successful training for networks that fail to find a deep minima of the standard cross-entropy loss. In overparameterized networks, dynamical loss functions can lead to better generalization. Improvement arises from the interplay of the changing loss landscape with the dynamics of the system as it evolves to minimize the loss. In particular, as the loss function oscillates, instabilities develop in the form of bifurcation cascades, which we study using the Hessian and Neural Tangent Kernel. Valleys in the landscape widen and deepen, and then narrow and rise as the loss landscape changes during a cycle. As the landscape narrows, the learning rate becomes too large and the network becomes unstable and bounces around the valley. This process ultimately pushes the system into deeper and wider regions of the loss landscape and is characterized by decreasing eigenvalues of the Hessian. This results in better regularized models with improved generalization performance.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 26 of its 80 references that are in the map. First posted on arXiv 7 Feb 2021.

Builds on

26 of 80 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2016Understanding deep learning requires rethinking generalizationcited by 1,674
  4. 2016Neural Architecture Search with Reinforcement Learningcited by 1,499
  5. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
  6. 2018AutoAugment: Learning Augmentation Policies from Datacited by 730
  7. 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 722
  8. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  9. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
  10. 2014The Loss Surfaces of Multilayer Networkscited by 280
  11. 2018Gradient Descent Happens in a Tiny Subspacecited by 217
  12. 2020The large learning rate phase of deep learning: the catapult mechanismcited by 216
14 more
  1. 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
  2. 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 159
  3. 2019Neural Tangents: Fast and Easy Infinite Neural Networks in Pythoncited by 149
  4. 2019Scaling description of generalization with number of parameters in deep learningcited by 83
  5. 2017On Loss Functions for Deep Neural Networks in Classificationcited by 68
  6. 2018The jamming transition as a paradigm to understand the loss landscape of deep neural networkscited by 62
  7. 2020Neural Kernels Without Tangentscited by 56
  8. 2018The loss landscape of overparameterized neural networkscited by 39
  9. 2017The landscape of the spiked tensor modelcited by 34
  10. 2020Temperature check: theory and practice for training models with softmax-cross-entropy lossescited by 31
  11. 2016No bad local minima: Data independent training error guarantees for multilayer neural networkscited by 30
  12. 2019Who is Afraid of Big Bad Minima? Analysis of Gradient-Flow in a Spiked Matrix-Tensor Modelcited by 25
  13. 2020Pyramidal Convolution: Rethinking Convolutional Neural Networks for Visual Recognitioncited by 25
  14. 2020Perspective: A Phase Diagram for Deep Learning unifying Jamming, Feature Learning and Lazy Trainingcited by 11

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 1; 2024: 1; 2025: 0; 2026: 1.

7 papers.