On learning of Sigmoid Neural Networks
โ Scribed by Kayvan Najarian
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 149 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1076-2787
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The template coefficients (weights) of a CNN which will give a desired performance, can either be found by design or by learning. 'By design' means that the desired function to be performed can be translated into a set of local dynamic rules, while 'by learning' is based exclusively on pairs of inpu
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 \_( y)=1ร1+e & y is bounded by a quadratic poly