Publication View

Polynomial bounds for VC dimension of sigmoidal and general pfaffian neural networks (1997)

Abstract

Abstract. We introduce a new method for proving explicit upper bounds on the VC Dimension of general functional basis networks, and prove as an application, for the first time, that the VC Dimension of analog neural networks with the sigmoidal activation function oe(y) = 1=1+e \Gammay is bounded by a quadratic polynomial O((lm) 2) in both the number l of programmable parameters, and the number m of nodes. The proof method of this paper generalizes to much wider class of Pfaffian activation functions and formulas, and gives also for the first time polynomial bounds on their VC Dimension. We present also some other applications of our method. 0

Publication details

Download	http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.30.5039
Source	http://theory.cs.uni-bonn.de/~marek/publications/poly_bounds_for_vc_dim.ps.Z
Contributors	CiteSeerX
Repository	CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Type	text
Language	English
Relation	10.1.1.48.165, 10.1.1.61.4573, 10.1.1.50.7595, 10.1.1.49.8669, 10.1.1.73.9634, 10.1.1.29.3530, 10.1.1.37.8202, 10.1.1.8.1178, 10.1.1.52.552, 10.1.1.54.4842, 10.1.1.48.5116, 10.1.1.18.46, 10.1.1.40.265, 10.1.1.7.7981, 10.1.1.63.2675, 10.1.1.40.61, 10.1.1.7.8202, 10.1.1.85.5115, 10.1.1.132.2764, 10.1.1.53.8861, 10.1.1.30.2269, 10.1.1.22.2911, 10.1.1.10.1662, 10.1.1.27.5691, 10.1.1.3.6098, 10.1.1.33.3667, 10.1.1.33.375, 10.1.1.35.20, 10.1.1.4.6715, 10.1.1.41.8239, 10.1.1.66.4531, 10.1.1.75.3126, 10.1.1.75.6204, 10.1.1.76.5962, 10.1.1.36.2846, 10.1.1.78.4950, 10.1.1.8.6545, 10.1.1.8.7143, 10.1.1.80.7690, 10.1.1.84.4030, 10.1.1.9.3028, 10.1.1.93.7663, 10.1.1.112.9455, 10.1.1.51.8382