Abstract
We apply evolutionary algorithms to Hopfield model of associative memory. Previously we reported that a genetic algorithm using ternary chromosomes evolves the Hebb-rule associative memory to enhance its storage capacity by pruning some connections. This paper describes a genetic algorithm using real-encoded chromosomes which successfully evolves over-loaded Hebbian synaptic weights to function as an associative memory. The goal of this study is to shed new light on the analysis of the Hopfield model, which also enables us to use the model as more challenging test suite for evolutionary computations.
Preview
Unable to display preview. Download preview PDF.
References
K. DeJong (1975) An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D thesis, University of Michigan.
D. Ackley (1987) A Connectionist Machine for Genetic Hillclimbing. Boston: Kluwer.
K. Deb (1989) Genetic Algorithms in Multimodal Function Optimization. Master's thesis. The University of Alabama.
H. Mühlenbein, M. Schomish, and J. Born (1991) The Parallel Genetic Algorithm as Function Optimizer. Parallel Computing 17 pp619–632.
J. D. Schaffer, B. A. Caruana, L. J. Eshlman, and R. Das (1991) A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. Proceedings of the 3rd International Conference on Genetic Algorithms. pp51–60.
D. Whitley, K. Mathias, S. Rana, and J. Dzubera (1995) Building Better Test Functions. Proceedings of the 6th International Conference on Genetic Algorithms. pp239–247.
S. M. Mahfoud (1995) A. Comparison of Parallel and Sequential Niching Methods. Proceedings of the 6th International Conference on Genetic Algorithms. pp239–247.
D. Schlierkamp-Voosen, and H. Mühlenbein (1996) Adaptation of Population Sizes by Competing Subpopulation. Proceedings of IEEE International Conference on Evolutionary Computation. pp330–335.
H. Mühlenbein, and D. Schlierkamp-Voosen (1995) Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization. Evolutionary Computation 1 (1996) pp25–49.
E. Gardner (1988) The Phase Space of Interactions in Neural Network Models. J. Phys A: Math Gen. 21. pp257–270.
H. Sompolinsky (1986) Neural Network with Non-linear Synapses and Static Noise. Phys. Rev. A34 pp2571–2574.
J. D. Schaffer, D. Whitley, and L. J. Eshelman (1992) Combinations of Genetic Algorithms and Neural Networks: A Survey of the State of the Art. Proceedings of the Workshop on Combinations of Genetic Algorithms and Neural Networks. pp1–37.
X. Yao (1993) A Review of Evolutionary Artificial Neural Networks. International Journal of Intelligent Systems 8. pp539–567.
A. Imada, and K. Araki (1997) Evolved Asymmetry and Dilution of Random Synaptic Weights in Hopfield Network Turn a Spin-glass Phase into Associative Memory. The 2nd International Conference on Computational Intelligence and Neuroscience (to appear)
A. Imada, and K. Araki (1995) Genetic Algorithm Enlarges the Capacity of Associative Memory. Proceedings of the 6th International Conference on Genetic Algorithms. pp413–420.
J. Komlós, and R. Paturi (1988) Convergence Results in an Associative Memory Model. Neural Networks 1. pp239–250.
J. J. Hopfield (1982) Neural Networks and Physical Systems with Emergent Collective Computational Abilities. Proceedings of the National Academy of Sciences, USA. 79. pp2554–2558.
D. O. Hebb (1949) The Organization of Behavior. Wiley.
D. J. Amit, H. Gutfreund, and H. Sompolinsky (1985) Statistical Mechanics of Neural Networks near Saturation Annals. of Physics 173, pp30–67.
R. J. McEliced, E. C. Posner, E. R. Rodemick, and S. S. Venkatesh (1987) The Capacity of the Hopfield Associative Memory. IEEE Trans. Information Theory IT-33. pp461–482.
T. Kohonen, and M. Ruohonen (1973) Representation of Associated Data by Matrix Operators. IEEE Trans. Computers C-22(7). pp701–702.
G. Pancha, S. S. VenKatesh (1993) Feature and Memory-Selective Error correction in Neural Associative Memory. in M. H. Hassoun eds. Associative Neural Memories: Theory and Implementation. Oxford University Press. pp225–238.
G. Syswerda (1989) Uniform Crossover in Genetic Algorithms. Proceedings of the 3rd International Conference on Genetic Algorithms, 2.
D. J. Amit, H. Gutfreund, and H. Sompolinsky (1985) Storing Infinite Number of Patterns in a Spin-glass Model of Neural Networks. Physical Review Letters 55. pp1530–1533.
J. A. Hertz, G. Grinstein, and S. A. Solla (1987) Irreversible Spin Glasses an Neural Networks. in L. N. van Hemmen and I. Morgenstern eds. Heidelberg Colloquium on Glassy Dynamics. Lecture Notes in Physics No.275 Springer-Verlag, pp538–546.
G. Parisi (1986) Asymmetric Neural Networks and the Process of Learning. J. Phys. A19 ppL675–L680.
W. Krauth, J.-P. Nadal, and M.Mezard (1988) The Roles of Stability and Symmetry in the Dynamics of Neural Networks. J. Phys. A: Math. Gen. 21 pp2995–3011.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Imada, A., Araki, K. (1997). Random perturbations to Hebbian synapses of associative memory using a genetic algorithm. In: Mira, J., Moreno-DÃaz, R., Cabestany, J. (eds) Biological and Artificial Computation: From Neuroscience to Technology. IWANN 1997. Lecture Notes in Computer Science, vol 1240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032498
Download citation
DOI: https://doi.org/10.1007/BFb0032498
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63047-0
Online ISBN: 978-3-540-69074-0
eBook Packages: Springer Book Archive