The attractors in sequence processing neural networks
Yong Chen, Ying Hai Wang, Kong Qing Yang

TL;DR
This paper investigates the properties of attractors in sequence processing neural networks, revealing a critical loading ratio and exponential growth in attractor length, with implications for network robustness.
Contribution
It introduces a detailed analysis of attractor length and relaxation time in neural networks, identifying a critical point and exponential growth behavior.
Findings
Critical loading ratio identified
Attractor length grows exponentially with loading ratio
Relaxation time linearly related to loading ratio
Abstract
The average length and average relaxation time of attractors in sequence processing neural networks are investigated. The simulation results show that a critical point of , the loading ratio, is found. Below the turning point, the average length is equal to the number of stored patterns; conversely, the ratio of length and numbers of stored patterns, grow with an exponential dependence . Moreover, we find that the logarithm of average relaxation time is only linearly associated with and the turning point of coupling degree is located for examining robustness of networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
