MIT CogNet, The Brain Sciences ConnectionFrom the MIT Press, Link to Online Catalog
SPARC Communities
Subscriber : Stanford University Libraries » LOG IN

space

Powered By Google 
Advanced Search

 

Tight Bounds for the VC-Dimension of Piecewise Polynomial Networks

 Akito Sakurai
  
 

Abstract:
O(ws(s log + log (dqh / s))) and O(ws((h/s) log q) + log (dqh / s)) are upper bounds for the VC-dimension of a set of neural networks of units with piecewise polynomial activation functions, where h is the number of hidden units, w is the number of adjustable parameters, q is the maximum of the number of polynomial segments of the activation function, and d is the maximum degree of the polynomials; also (ws log (dqh / s)) is a lower bound for the VC-dimension of such a network set, which are tight for the cases s = (h) and s is constant. For the special case q=1, the VC-dimension is (ws log d).

 
 


© 2010 The MIT Press
MIT Logo