Stability of Accuracy for the Training of DNNs Via the Uniform Doubling Condition
Not on the map. Why?
Abstract (arXiv)
We study the stability of accuracy during the training of deep neural networks (DNNs). In this context, the training of a DNN is performed via the minimization of a cross-entropy loss function, and the performance metric is accuracy (the proportion of objects that are classified correctly). While training results in a decrease of loss, the accuracy does not necessarily increase during the process and may sometimes even decrease. The goal of achieving stability of accuracy is to ensure that if accuracy is high at some initial time, it remains high throughout training. A recent result by Berlyand, Jabin, and Safsten introduces a doubling condition on the training data, which ensures the stability of accuracy during training for DNNs using the absolute value activation function. For training data in ℝn, this doubling condition is formulated using slabs in ℝn and depends on the choice of the slabs. The goal of this paper is twofold. First, to make the doubling condition uniform, that is, independent of the choice of slabs. This leads to sufficient conditions for stability in terms of training data only. In other words, for a training set T that satisfies the uniform doubling condition, there exists a family of DNNs such that a DNN from this family with high accuracy on the training set at some training time t0 will have high accuracy for all time t>t0. Moreover, establishing uniformity is necessary for the numerical implementation of the doubling condition. The second goal is to extend the original stability results from the absolute value activation function to a broader class of piecewise linear activation functions with finitely many critical points, such as the popular Leaky ReLU.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 12 of its 30 references that are in the map. First posted on arXiv 16 Oct 2022.
Builds on
12 of 30 references.
References · 12
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2013Intriguing properties of neural networkscited by 5,114
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2019On Mixup Training: Improved Calibration and Predictive Uncertainty for Deep Neural Networkscited by 304
- 2016Improving the Robustness of Deep Neural Networks via Stability Trainingcited by 156
- 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
- 2017Generalization in Deep Learningcited by 146
- 2020Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsificationcited by 52
- 2018Trained Rank Pruning for Efficient Deep Neural Networkscited by 23
- 2022Boundary between noise and information applied to filtering neural network weight matricescited by 9
- 2020Stability for the Training of Deep Neural Networks and Other Classifierscited by 3
Built on by
Not cited yet.