Do We Need Zero Training Loss After Achieving Zero Training Error?
Takashi Ishida, Ikko Yamane, Tomoya Sakai, Gang Niu, Masashi Sugiyama
Abstract
Overparameterized deep networks have the capacity to memorize training data with zero training error. Even after memorization, the training loss continues to approach zero, making the model overconfident and the test performance degraded. Since existing regularizers do not directly aim to avoid zero training loss, they often fail to maintain a moderate level of training loss, ending up with a too small or too large loss. We propose a direct solution called flooding that intentionally prevents further reduction of the training loss when it reaches a reasonably small value, which we call the flooding level. Our approach makes the loss float around the flooding level by doing mini-batched gradient descent as usual but gradient ascent if the training loss is below the flooding level. This can be implemented with one line of code, and is compatible with any stochastic optimizer and other regularizers. With flooding, the model will continue to "random walk" with the same non-zero training loss, and we expect it to drift into an area with a flat loss landscape that leads to better generalization. We experimentally show that flooding improves performance and as a byproduct, induces a double descent curve of the test loss.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers25
- Understanding and Improving Early Stopping for Learning with Noisy LabelsYingbin Bai, Erkun Yang, Bo Han, Yanhua Yang et al.NeurIPS 2021 · 307 citations
- Discriminative Complementary-Label Learning with Weighted LossYi Gao, Min-Ling ZhangICML 2021 · 48 citations
- Flooding-X: Improving BERT's Resistance to Adversarial Attacks via Loss-Restricted Fine-TuningQin Liu, Rui Zheng, Bao Rong, Jingyi Liu et al.ACL 2022 · 35 citations
- On the Generalization of Models Trained with SGD: Information-Theoretic Bounds and ImplicationsZiqiao Wang, Yongyi MaoICLR 2022 · 33 citations
- Coupled Confusion Correction: Learning from Crowds with Sparse AnnotationsHansong Zhang, Shikun Li, Dan Zeng, Chenggang Yan et al.AAAI 2024 · 23 citations
Builds on1
Related papers
- Understanding Gradient Regularization in Deep Learning: Efficient Finite-Difference Computation and Implicit BiasRyo Karakida, Tomoumi Takase, Tomohiro Hayase, Kazuki OsawaICML 2023 · 23 citations
- iFlood: A Stable and Effective RegularizerYuexiang Xie, Zhen Wang, Yaliang Li, Ce Zhang et al.ICLR 2022 · 6 citations
- On the Origin of Implicit Regularization in Stochastic Gradient DescentSamuel L. Smith, Benoit Dherin, David G. T. Barrett, Soham DeICLR 2021 · 235 citations
- SIGUA: Forgetting May Make Learning with Noisy Labels More RobustBo Han, Gang Niu, Xingrui Yu, Quanming Yao et al.ICML 2020 · 157 citations
- The Neural Tangent Kernel in High Dimensions: Triple Descent and a Multi-Scale Theory of GeneralizationBen Adlam, Jeffrey PenningtonICML 2020 · 133 citations
