Associative Memory by Recurrent Neural Networks with Delay Elements

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 10figures

Scientific paper

The synapses of real neural systems seem to have delays. Therefore, it is worthwhile to analyze associative memory models with delayed synapses. Thus, a sequential associative memory model with delayed synapses is discussed, where a discrete synchronous updating rule and a correlation learning rule are employed. Its dynamic properties are analyzed by the statistical neurodynamics. In this paper, we first re-derive the Yanai-Kim theory, which involves macrodynamical equations for the dynamics of the network with serial delay elements. Since their theory needs a computational complexity of $O(L^4t)$ to obtain the macroscopic state at time step t where L is the length of delay, it is intractable to discuss the macroscopic properties for a large L limit. Thus, we derive steady state equations using the discrete Fourier transformation, where the computational complexity does not formally depend on L. We show that the storage capacity $\alpha_C$ is in proportion to the delay length L with a large L limit, and the proportion constant is 0.195, i.e., $\alpha_C = 0.195 L$. These results are supported by computer simulations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Associative Memory by Recurrent Neural Networks with Delay Elements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Associative Memory by Recurrent Neural Networks with Delay Elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Associative Memory by Recurrent Neural Networks with Delay Elements will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-160002

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.