title: Almost linear VC-dimension bounds for piecewise polynomial networks
abstract: We compute upper and lower bounds on the VC dimension and pseudo-dimension of feedforward neural networks composed of piecewise polynomial activation functions. We show that if the number of layers is fixed, then the VC dimension and pseudo-dimension grow as WlogW, where W is the number of parameters in the network. This result stands in opposition to the case where the number of layers is unbounded, in which case the VC dimension and pseudo-dimension grow as W2. We combine our results with recently established approximation error rates and determine error bounds for the problem of regression estimation by piecewise polynomial networks with unbounded weights.
authors.affiliation: Australian National University, Systems Engineering Dept, Canberra, AU, 0200. Peter.Bartlett@anu.edu.au.
authors.initials: PL
authors.lastname: Bartlett
authors.initials: V
authors.lastname: Maiorov
authors.initials: R
authors.lastname: Meir