Rademacher Complexity

Tuesday, September 17, 2019 - 9:00am - 10:00am
Andrew Barron (Yale University)
For deep nets we examine contraction properties of complexity for each layer of the network. For any ReLU network there is, without loss of generality, a representation in which the sum of the absolute values of the weights into each node is exactly 1, and the input layer variables are multiplied by a value V coinciding with the total variation of the path weights. Implications are given for Gaussian complexity, Rademacher complexity, statistical risk, and metric entropy, all of which are shown to be proportional to V.
Subscribe to RSS - Rademacher Complexity