By Topic

Memory capacity bound and threshold optimization in recurrent neural network with variable hysteresis threshold

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
$33 $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

3 Author(s)
K. Nakayama ; Dept. of Electr. & Comput. Eng., Kanazawa Univ., Japan ; K. Nishimura ; H. Katayama

The authors propose an asymmetrical associative neural network (NN) using variable hysteresis threshold and its learning and association algorithms. It can drastically improve the noise performance, i.e. insensitivity to noise. The memory capacity bound and threshold optimization in this associative NN are further discussed. Binary random patterns are considered. First, relation between the number of patterns and the number of iterations is investigated. The latter gradually increases until some number of patterns. After that, it suddenly increases. This is a very peculiar phenomenon. This turning point gives the memory capacity bound, that is about 1.56N, where N is the number of units. Next, the threshold optimization is discussed. Relation between threshold and noise performance, and effects of connection weight distribution on noise performance are theoretically discussed. Based on these results, a ratio of step-size and the threshold is optimized to be 0.5/(Np-1), where NP is the number of units on the pattern. Statistical simulation demonstrates the efficiency of the proposed methods.

Published in:

Neural Networks, 1993. IJCNN '93-Nagoya. Proceedings of 1993 International Joint Conference on  (Volume:3 )

Date of Conference:

25-29 Oct. 1993