Soft ascent-descent as a stable and flexible alternative to flooding
Not on the map. Why?
Abstract (arXiv)
As a heuristic for improving test accuracy in classification, the "flooding" method proposed by Ishida et al. (2020) sets a threshold for the average surrogate loss at training time; above the threshold, gradient descent is run as usual, but below the threshold, a switch to gradient ascent is made. While setting the threshold is non-trivial and is usually done with validation data, this simple technique has proved remarkably effective in terms of accuracy. On the other hand, what if we are also interested in other metrics such as model complexity or average surrogate loss at test time? As an attempt to achieve better overall performance with less fine-tuning, we propose a softened, pointwise mechanism called SoftAD (soft ascent-descent) that downweights points on the borderline, limits the effects of outliers, and retains the ascent-descent effect of flooding, with no additional computational overhead. We contrast formal stationarity guarantees with those for flooding, and empirically demonstrate how SoftAD can realize classification accuracy competitive with flooding (and the more expensive alternative SAM) while enjoying a much smaller loss generalization gap and model norm.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 39 of its 62 references that are in the map. First posted on arXiv 16 Oct 2023.
Builds on
39 of 62 references.
References · 39
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2017Exploring Generalization in Deep Learningcited by 600
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 307
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2017A General and Adaptive Robust Loss Functioncited by 236
27 more
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 184
- 2018Stochastic model-based minimization of weakly convex functionscited by 159
- 2020Implicit Gradient Regularizationcited by 146
- 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
- 2020Descending through a Crowded Valley - Benchmarking Deep Learning Optimizerscited by 119
- 2020Tilted Empirical Risk Minimizationcited by 106
- 2018Universal Statistics of Fisher Information in Deep Neural Networks: Mean Field Approachcited by 91
- 2017Towards Understanding Generalization of Deep Learning: Perspective of Loss Landscapescited by 84
- 2021High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tailscited by 80
- 2020In Search of Robust Measures of Generalizationcited by 79
- 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
- 2016Efficiency of minimizing compositions of convex functions and smooth mapscited by 59
- 2020The Unreasonable Effectiveness of Deep Learning in Artificial Intelligencecited by 57
- 2023Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversioncited by 45
- 2016Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Backcited by 37
- 2020Learning Bounds for Risk-sensitive Learningcited by 33
- 2022Is the Performance of My Deep Network Too Good to Be True? A Direct Approach to Estimating the Bayes Error in Binary Classificationcited by 26
- 2022Rank-based Decomposable Losses in Machine Learning: A Surveycited by 26
- 2022Understanding Gradient Regularization in Deep Learning: Efficient Finite-Difference Computation and Implicit Biascited by 16
- 2019Information-Theoretic Local Minima Characterization and Regularizationcited by 14
- 2019A Geometric Modeling of Occam's Razor in Deep Learningcited by 8
- 2020Learning with risks based on M-locationcited by 6
- 2023Inconsistency, Instability, and Generalization Gap of Deep Neural Network Trainingcited by 6
- 2021A Survey of Learning Criteria Going Beyond the Usual Riskcited by 4
- 2022Flexible risk design using bi-directional dispersioncited by 3
- 2022Risk-Adaptive Approaches to Stochastic Optimization: A Surveycited by 2
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.