Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

n-h-1 networks store no less n×h+1 examples, but sometimes no more

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sakurai, A. ; Hitachi Ltd., Saitama, Japan

The author shows that an n-h-1 artificial neural network with n real inputs, a single layer of h hidden units, and one binary output unit can store correctly at least n×h+1 examples in a general position. The proof is constructive so that weights are obtained deterministically from examples. The result is thought to be a generalization of the fact that one threshold gate can remember any n+1 examples in a general position. The number obtained is a good lower bound of the network capacity and is a great improvement on the previous best bound by S. Akaho and S. Amari (1990). It is also shown that the figure nh+1 is tight in a certain sense

Published in:

Neural Networks, 1992. IJCNN., International Joint Conference on  (Volume:3 )

Date of Conference:

7-11 Jun 1992