By Topic

A universal neural net with guaranteed convergence to zero system error

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

2 Author(s)
Chang, Tsu-Shuan ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Davis, CA, USA ; Abdel-Ghaffar, K.A.S.

A learning algorithm with guaranteed convergence to zero system error is developed. The algorithm also has high potential to converge fast. The basic idea is to let the net grow when stopping at a local minimum, so that the original local minimum is no longer a local minimum with regard to the new net, and the new net always starts from a point with less error than that in the original local minimum. By this method, the error is guaranteed to decrease until it converges to zero. The technique can also be used to make the error to be as small as desired when the backpropagation algorithm reaches a global minimum which does not achieve zero error due to a lack of sufficient number of nodes. When expanding the neural net, the initial weights of the new node can be selected to maximize the error gradient. A mathematical proof of the guaranteed learning of the universal neural net is given, and numerical examples illustrate its high potential for fast learning

Published in:

Signal Processing, IEEE Transactions on  (Volume:40 ,  Issue: 12 )