Improve the Robustness and Accuracy of Deep Neural Network with L2,∞ Normalization
Abstract
In this paper, the robustness and accuracy of the deep neural network (DNN) was enhanced by introducing the L2,∞ normalization of the weight matrices of the DNN with Relu as the activation function. It is proved that the L2,∞ normalization leads to large dihedral angles between two adjacent faces of the polyhedron graph of the DNN function and hence smoother DNN functions, which reduces over-fitting. A measure is proposed for the robustness of a classification DNN, which is the average radius of the maximal robust spheres with the sample data as centers. A lower bound for the robustness measure is given in terms of the L2,∞ norm. Finally, an upper bound for the Rademacher complexity of DNN with L2,∞ normalization is given. An algorithm is given to train a DNN with the L2,∞ normalization and experimental results are used to show that the L2,∞ normalization is effective to improve the robustness and accuracy.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.