Abstract
The performance characteristics of five variants of the Hopfield network are examined. Two performance metrics are used: memory capacity, and a measure of the size of basins of attraction. We find that the post-training adjustment of processor thresholds has, at best, little or no effect on performance, and at worst a significant negative effect. The adoption of a local learning rule can, however, give rise to significant performance gains.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Diederich, S. and M. Opper (1987). Learning of Correlated Patterns in Spin-Glass Networks by Local Learning Rules. Physical Review Letters 58, 949–952
Hertz, J., A. Krogh and R.G. Palmer (1991). Introduction to the Theory of Neural Computation Addison-Wesley
Kanter, I. and H. Sompolinsky (1987). Associative Recall of Memory Without Errors. Physical Review A 35, 380–392
Personnaz, L., I. Guyon and D. Dreyfus (1986). Collective Computational Properties of Neural Networks: New Learning Mechanisms. Physical Review A 34, 4217–4228
Schultz, A. (1995). Five Variations of Hopfield Associative Memory Network. Journal of Artificial Neural Networks 2(3), 285–294
Storkey, A., and R. Valabregue (1997) Hopfield Learning Rule with High Capacity Storage of Time-Correlated Patterns. Electronics Letters 33(21), 1803–1804
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Davey, N., Hunt, S.P. (1999). The capacity and attractor basins of associative memory models. In: Mira, J., Sánchez-Andrés, J.V. (eds) Foundations and Tools for Neural Modeling. IWANN 1999. Lecture Notes in Computer Science, vol 1606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0098189
Download citation
DOI: https://doi.org/10.1007/BFb0098189
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66069-9
Online ISBN: 978-3-540-48771-5
eBook Packages: Springer Book Archive