In this paper we study the problem of the occurrence of cycles in autoassociative neural networks. We call these cycles dynamic attractors, show when and why they occur and how they can be identified. Of particular interest is the pseudo-inverse network with reduced self-connection. We prove that it has dynamic attractors, which occur with a probability proportional to the number of prototypes and the degree of weight reduction. We show how to predict and avoid them.
CITATION STYLE
Gorodnichy, D. O., & Reznik, A. M. (1997). Static and dynamic attractors of autoassociative neural networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1311, pp. 238–245). Springer Verlag. https://doi.org/10.1007/3-540-63508-4_128
Mendeley helps you to discover research relevant for your work.