Enhanced Error-free Retrieval in Kuramoto-type Associative-memory Networks via Two-memory Configuration
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908369214767104 |
|---|---|
| author | Li, Zhuchun Zhao, Xiaoxue Zhou, Xiang |
| author_facet | Li, Zhuchun Zhao, Xiaoxue Zhou, Xiang |
| contents | We study the associative-memory network of Kuramoto-type oscillators that stores a set of memorized patterns (memories). In [Phys. Rev. Lett., 92 (2004), 108101], Nishikawa, Lai and Hoppensteadt showed that the capacity of this system for pattern retrieval with small errors can be made as high as that of the Hopfield network. Some stability analysis efforts focus on mutually orthogonal memories; however, the theoretical results do not ensure error-free retrieval in general situations. In this paper, we present a route for using the model in pattern retrieval problems with small or large errors. We employ the eigenspectrum analysis of Jacobians and potential analysis of the gradient flow to derive the stability/instability of binary patterns. For two memories, the eigenspectrum of Jacobian at each pattern can be specified, which enables us to give the critical value of the parameter to distinguish the memories from all other patterns in stability. This setting of two memories substantially reduces the number of stable patterns and enlarges their basins, allowing us to recover defective patterns. We extend this approach to general cases and present a deterministic method for ensuring error-free retrieval across a general set of standard patterns. Numerical simulations and comparative analyses illustrate the approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_12223 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Enhanced Error-free Retrieval in Kuramoto-type Associative-memory Networks via Two-memory Configuration Li, Zhuchun Zhao, Xiaoxue Zhou, Xiang Dynamical Systems 34C15, 92C42 We study the associative-memory network of Kuramoto-type oscillators that stores a set of memorized patterns (memories). In [Phys. Rev. Lett., 92 (2004), 108101], Nishikawa, Lai and Hoppensteadt showed that the capacity of this system for pattern retrieval with small errors can be made as high as that of the Hopfield network. Some stability analysis efforts focus on mutually orthogonal memories; however, the theoretical results do not ensure error-free retrieval in general situations. In this paper, we present a route for using the model in pattern retrieval problems with small or large errors. We employ the eigenspectrum analysis of Jacobians and potential analysis of the gradient flow to derive the stability/instability of binary patterns. For two memories, the eigenspectrum of Jacobian at each pattern can be specified, which enables us to give the critical value of the parameter to distinguish the memories from all other patterns in stability. This setting of two memories substantially reduces the number of stable patterns and enlarges their basins, allowing us to recover defective patterns. We extend this approach to general cases and present a deterministic method for ensuring error-free retrieval across a general set of standard patterns. Numerical simulations and comparative analyses illustrate the approach. |
| title | Enhanced Error-free Retrieval in Kuramoto-type Associative-memory Networks via Two-memory Configuration |
| topic | Dynamical Systems 34C15, 92C42 |
| url | https://arxiv.org/abs/2505.12223 |