13
Views
2
CrossRef citations to date
0
Altmetric
Original Article

A search for the optimal thresholding sequence in an associative memory

&
Pages 741-756 | Received 15 Sep 1995, Published online: 09 Jul 2009
 

Abstract

In learning matrix associative memory networks, the choice of threshold value is one of the most significant factors for determining the recall performance. Choice of threshold is especially important for multi-step recall, as each network state is dependent on the prior states. Recently, Gibson and Robinson used a statistical approximation to formalize the dynamics of partially connected recurrent networks. Using this formalism, we evaluate all of the possible thresholding sequences and find the sequence that results in the highest storage capacity. The resulting optimal strategy can be closely approximated by a threshold that is proportional to the activation of the network plus an offset. The performance of a simulated associative memory is shown to match well with the predictions of the theory. This strategy corresponds to one of the simplest putative roles of interneurons which provide a linear output proportional to the total unweighted input from the principal cells.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.