On Measuring Excess Capacity in Neural NetworksDownload PDF

Published: 31 Oct 2022, 18:00, Last Modified: 14 Oct 2022, 11:13NeurIPS 2022 AcceptReaders: Everyone
Keywords: Deep learning theory, Rademacher complexity, Residual networks, Convolutions, Excess capacity
TL;DR: We extend and unify prior Rademacher complexity bounds for several key components of neural networks and use this capacity measure as a means of quantifying by how much one can reduce capacity while retaining empirical performance.
Abstract: We study the excess capacity of deep networks in the context of supervised classification. That is, given a capacity measure of the underlying hypothesis class - in our case, empirical Rademacher complexity - to what extent can we (a priori) constrain this class while retaining an empirical error on a par with the unconstrained regime? To assess excess capacity in modern architectures (such as residual networks), we extend and unify prior Rademacher complexity bounds to accommodate function composition and addition, as well as the structure of convolutions. The capacity-driving terms in our bounds are the Lipschitz constants of the layers and a (2,1) group norm distance to the initializations of the convolution weights. Experiments on benchmark datasets of varying task difficulty indicate that (1) there is a substantial amount of excess capacity per task, and (2) capacity can be kept at a surprisingly similar level across tasks. Overall, this suggests a notion of compressibility with respect to weight norms, complementary to classic compression via weight pruning. Source code is available at https://github.com/rkwitt/excess_capacity.
Supplementary Material: zip
19 Replies

Loading