Abstract
Associative memory model of neural networks can not store items more than its memory capacity. When new items are given one after another, its connection weights should be decayed so that the number of stored items does not exceed the memory capacity (forgetting process). This paper analyzes the sparsely encoded associative memory, and presents the optimal decay rate that maximizes the number of stored items. The maximal number of stored items is given by O(n/a log n) when the decay rate is 1-O (a log n/n), where the network consists of n neurons with activity a.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Akaho: Optimal decay rate of connection weights in covariance learning. Technical Report 92-37, Electrotechnical Laboratory, 1992.
S. Amari: Characteristics of sparsely encoded associative memory. Neural Networks, Vol. 2, No. 6, pp. 451–457, 1989.
J.A. Anderson: A simple neural network generating interactive memory. Mathematical Bio-sciences, Vol. 14, pp. 197–220, 1972.
M. Mézard, J.P. Nadal, and G. Toulouse: Solvable models of working memories. J. Physique, Vol. 47, pp. 1457–1462, 1986.
V.A. Vapnik: Estimation of Dependences Based on Empirical Data. Springer-Verlag, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag London Limited
About this paper
Cite this paper
Akaho, S. (1993). Capacity and Error Correction Ability of Sparsely Encoded Associative Memory with Forgetting Process. In: Gielen, S., Kappen, B. (eds) ICANN ’93. ICANN 1993. Springer, London. https://doi.org/10.1007/978-1-4471-2063-6_198
Download citation
DOI: https://doi.org/10.1007/978-1-4471-2063-6_198
Published:
Publisher Name: Springer, London
Print ISBN: 978-3-540-19839-0
Online ISBN: 978-1-4471-2063-6
eBook Packages: Springer Book Archive