Delay for the capacity-simplicity dilemma in associative memory attractor networks

  • Authors:
  • Shaofen Zou;Yuming Chen;Jianfu Ma;Jianhong Wu

  • Affiliations:
  • College of Mathematics and Econometrics, Hunan University, Changsha, Hunan 410082, China;Department of Mathematics, Wilfrid Laurier University, Waterloo, Ontario N2L 3C5, Canada;Department of Biochemistry and Molecular Biology, The University of Texas Health Science Center at Houston Medical School, Houston, TX 77225, USA;Department of Mathematics and Statistics, York University, Toronto, Ontario M3J 1P3, Canada

  • Venue:
  • Neural Networks
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the issue of how a simple network with delayed feedback can exhibit complex but desired dynamical behaviors for memory storage and retrieval. We discuss the simplicity-capacity dilemma arising from the requirement of both large capacity and easy implementation in additive networks. We then propose a novel approach based on signal processing delay and show that the interaction of delay, feedback and refractoriness in a simple inhibitory network of three neurons can generate mathematically trackable coexisting periodic patterns. Therefore, a simple and small network with delayed feedback can process a large amount of information, and time lag in our biological or artificial neural nets is useful for information processing. How the connection topology of a large network enhances the network's capacity for memory storage and retrieval remains to be an interesting task.