Norm-based generalisation bounds for deep multi-class convolutional neural networks

• Main Authors: LEDENT, Antoine, MUSTAFA, Waleed, LEI, Yunwen, KLOFT, Marius
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2021
• Subjects: (Deep) Neural Network Learning Theory; Learning Theory; Artificial Intelligence and Robotics; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/7202; https://ink.library.smu.edu.sg/context/sis_research/article/8205/viewcontent/norm_based.pdf
• Institution: Singapore Management University

We show generalisation error bounds for deep learning with two main improvements over the state of the art. (1) Our bounds have no explicit dependence on the number of classes except for logarithmic factors. This holds even when formulating the bounds in terms of the Frobenius-norm of the weight matrices, where previous bounds exhibit at least a squareroot dependence on the number of classes. (2) We adapt the classic Rademacher analysis of DNNs to incorporate weight sharing—a task of fundamental theoretical importance which was previously attempted only under very restrictive assumptions. In our results, each convolutional filter contributes only once to the bound, regardless of how many times it is applied. Further improvements exploiting pooling and sparse connections are provided. The presented bounds scale as the norms of the parameter matrices, rather than the number of parameters. In particular, contrary to bounds based on parameter counting, they are asymptotically tight (up to log factors) when the weights approach initialisation, making them suitable as a basic ingredient in bounds sensitive to the optimisation procedure. We also show how to adapt the recent technique of loss function augmentation to replace spectral norms by empirical analogues whilst maintaining the advantages of our approach.