Abstract
In this paper we analyze the pattern storage capacity of the exponential correlation associative memory(ECAM). This architecture was first studied by Chiueh and Goodman [3] who concluded that, under certain conditions on the input patterns, the memory has a storage capacity that was exponential in the length of the bit-patterns. A recent analysis by Pelillo and Hancock [9], using the Kanerva picture of recall, concluded that the storage capacity was limited by 2N−1/N 2. Both of these analyses can be criticised on the basis that they overlook the role of initial bit-errors in the recall process and deal only with the capacity for perfect pattern recall. In other words, they fail to model the effect of presenting corrupted patterns to the memory. This can be expected to lead to a more pessimistic limit. Here we model the performance of the ECAM when presented with corrupted input patterns. Our model leads to an expression for the storage capacity of the ECAM both in terms of the length of the bit-patterns and the probability of bit-corruption in the original input patterns. These storage capacities agree closely with simulation. In addition, our results show that slightly superior performance can be obtained by selecting an optimal value of the exponential constant.
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
J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proc. Natl. Acad. Sci. USA, vol. 79, pp. 2554–2558, 1982.
R. J. McEliece, E. C. Posner, E. R. Rodemich, and S. S. Venkatesh, “The capacity of the Hopfield associative memory,” IEEE Trans. Inform. Theory, vol. 33, pp. 461–482, 1987.
T. D. Chiueh and R. M. Goodman, “Recurrent correlation associative memories”, IEEE Trans. Neural Networks, vol. 2, pp. 275–284, 1991.
T. D. Chiueh and R. M. Goodman, “VLSI implementation of a high-capacity neural network associative memory”, in D. S. Touretzky, Ed., Advances in Neural Information Processing Systems 2. San Mateo, CA: Morgan-Kaufmann, 1990, pp. 793–800.
C. C. Wang and H. S. Don, “An analysis of high-capacity discrete exponential BAM,” IEEE Trans. Neural Networks, vol. 6, pp. 492–496, 1995.
C. C. Wang and J. P. Lee, “The decision-making properties of discrete multiple exponential bidirectional associative memories,” IEEE Trans. Neural Networks, vol. 6, pp. 993–999, 1995.
T. D. Chiueh and H. K. Tsai, “Multi-valued associative memories based on recurrent networks,” IEEE Trans. Neural Networks, vol. 4, pp. 364–366, 1993.
E.R. Hancock and J. Kittler, “Discrete Relaxation”, Pattern Recognition, 23, pp 711–733, 1990.
E.R. Hancock and M. Pelillo, “A Bayesian Interpretation for the Exponential Correlation Associative Memory”, Pattern Recognition Letters, 19, pp. 149–159, 1998.
R. C. Wilson and E. R. Hancock, “Structural Matching by Discrete Relaxation”, IEEE Trans. Pattern Anal. Machine Intell., vol. 19, pp. 634–648, 1997.
P. Kanerva, Sparse Distributed Memory. MIT Press, Cambridge, MA, 1988.
D. Milun and D. Sher, “Improving sampled probability distributions for Markov random fields,” Pattern Recognition Letters. v 14 pp. 781–788 1993.
P. A. Chou, “The capacity of the Kanerva associative memory is exponential,” in D. Z. Anderson, Ed., Neural Information Processing Systems. New York, NY: American Institute of Physics, 1988, pp. 184–191.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilson, R.C., Hancock, E.R. (1999). Storage capacity of the exponential correlation associative memory. 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/BFb0098186
Download citation
DOI: https://doi.org/10.1007/BFb0098186
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