Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > BOOLEAN COMPUTATION:
Reports tagged with Boolean Computation:
TR95-055 | 24th November 1995
Marek Karpinski, Angus Macintyre

#### VC Dimension of Sigmoidal and General Pfaffian Networks

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 $\sigma(y)=1/1+e^{-y}$ ... more >>>

ISSN 1433-8092 | Imprint