Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Bartlett, P. L.
Right arrow Articles by Meir, R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Bartlett, P. L.
Right arrow Articles by Meir, R.

Neural Computation, Vol 10, 2159-2173, Copyright © 1998 by The MIT Press

LETTERS

Almost Linear VC-Dimension Bounds for Piecewise Polynomial Networks

Peter L. Bartlett, Vitaly Maiorov and Ron Meir

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 W log W, 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.


This article has been cited by other articles:


Home page
 Neural Comput.Home page
M. Schmitt
On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach
Neural Comput., March 1, 2005; 17(3): 715 - 729.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
M. Schmitt
Neural Networks with Local Receptive Fields and Superlinear VC Dimension
Neural Comput., April 1, 2002; 14(4): 919 - 956.
[Abstract] [Full Text] [PDF]

Home page
 Neural Comput.Home page
M. Schmitt
On the Complexity of Computing and Learning with Multiplicative Neural Networks
Neural Comput., February 1, 2002; 14(2): 241 - 301.
[Abstract] [Full Text] [PDF]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1998 by The MIT Press.