Improving Generalization of Deep Neural Networks by Optimum Shifting
Not on the map. Why?
Abstract (arXiv)
Recent studies showed that the generalization of neural networks is correlated with the sharpness of the loss landscape, and flat minima suggests a better generalization ability than sharp minima. In this paper, we propose a novel method called optimum shifting, which changes the parameters of a neural network from a sharp minimum to a flatter one while maintaining the same training loss value. Our method is based on the observation that when the input and output of a neural network are fixed, the matrix multiplications within the network can be treated as systems of under-determined linear equations, enabling adjustment of parameters in the solution space, which can be simply accomplished by solving a constrained optimization problem. Furthermore, we introduce a practical stochastic optimum shifting technique utilizing the Neural Collapse theory to reduce computational costs and provide more degrees of freedom for optimum shifting. Extensive experiments (including classification and detection) with various deep neural network architectures on benchmark datasets demonstrate the effectiveness of our method.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 24 of its 30 references that are in the map. First posted on arXiv 23 May 2024.
Builds on
24 of 30 references.
References · 24
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,005
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2022Generative Adversarial Networkscited by 5,603
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
12 more
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
- 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 226
- 2019Implicit regularization for deep neural networks driven by an Ornstein-Uhlenbeck like processcited by 123
- 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
- 2022Extended Unconstrained Features Model for Exploring Deep Neural Collapsecited by 101
- 2022On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Featurescited by 97
- 2017Implicit Regularization in Deep Learningcited by 90
- 2023Sharpness Minimization Algorithms Do Not Only Minimize Sharpness To Achieve Better Generalizationcited by 39
- 2014MatConvNet - Convolutional Neural Networks for MATLABcited by 36
- 2023The Inductive Bias of Flatness Regularization for Deep Matrix Factorizationcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.