Memory search using complex dynamics in a recurrent neural network model

  • Authors:
  • Shigetoshi Nara;Peter Davis;Hiroo Totsuji

  • Affiliations:
  • Okayama University, Japan;ATR Optical and Radio Communications Research Laboratories, Japan;Okayama University, Japan

  • Venue:
  • Neural Networks
  • Year:
  • 1993

Quantified Score

Hi-index 0.01

Visualization

Abstract

Complex dynamics is expected to enable us to avoid combinatorial explosion and diverging program complexity that has been one of the essential difficulties in solving complex problems (for instance, an ill-posed problem) by serial processing algorithms. In this paper, it is shown by numerical investigations that a complicated memory search task is executable using complex dynamics in a recurrent neural network model with asymmetric synaptic connection. In spite of the simplicity of the proposed search algorithm, the complexity of chaotic wandering orbit in the state space offiring pattern leads us to a certain number of successful cases of search tasks with better efficiencies than random search. It is shown that the dynamical structure of chaotic orbit has a strong influence on the efficiency of search performance. A learning rule is proposed in order to realize ''constrained chaos'' that has, in the state space, a wandering structure suited to a given search task.