Iterative retrieval of sparsely coded associative memory patterns

doi:10.1016/0893-6080(95)00112-3

Iterative retrieval of sparsely coded associative memory patterns

1996-04-01

73

PRE

AI

F

Friedhelm Schwenker *

F

Friedrich T. Sommer

DOI：10.1016/0893-6080(95)00112-3

原文链接

原文求助

摘要

En 中文

We investigate the pattern completion performance of neural auto-associative memories composed of binary threshold neurons for sparsely coded binary memory patterns. By focussing on iterative retrieval, we are able to introduce effective threshold control strategies. These are investigated by means of computer simulation experiments and analytical treatment. To evaluate the systems performance we consider the completion capacity C and the mean retrieval errors. The asymptotic completion capacity values for the recall of sparsely coded binary patterns in one-step retrieval is known to be In 2/4 approximate to 17.32% for binary Hebbian learning, and 1/(8 In 2) approximate to 18% for additive Hebbian learning. These values are accomplished with vanishing error probability and yet are higher than those obtained in other known neural memory models. Recent investigations on binary Hebbian learning have proved that iterative retrieval as a more refined retrieval method does not improve the asymptotic completion capacity of one step retrieval. In a finite size auto-associative memory we show that iterative retrieval achieves higher capacity and better error correction than one-step retrieval. One-step retrieval produces high retrieval errors at optimal memory load. Iterative retrieval reduces the retrieval errors within a few iteration steps (t less than or equal to 5). Experiments with additive Hebbian learning show that in the finite model, binary Hebbian learning exhibits much better performance. Thus the main concern of this paper Is binary Hebbian learning. We examine iterative retrieval in experiments with up to n = 20,000 threshold neurons. With this system size one-step retrieval yields a completion capacity of about 16%, the second retrieval step increases this value to 17.9% and with iterative retrieval we obtain 19%. The first two retrieval steps in the finite system have also been treated analytically. For one-step retrieval the asymptotic capacity value is approximated from below with growing system size. In the second retrieval step (and as the experiments suggest also for iterative retrieval) the finite size behaviour is different. The capacity exceeds the asymptotic value, reaches an optimum for finite system size, and decreases to the asymptotic limit. Copyright (C) 1996 Elsevier Science Ltd

Keyword:

neural auto-associative memory

Hebbian learning

iterative retrieval

threshold control

sparse coding

Iterative retrieval of sparsely coded associative memory patterns

摘要

AI总结

期刊

机构

引用论文