The Characteristics of the Convergence Time of Associative Neural Networks

Abstract

The authors have analyzed the dynamics of associative neural networks based on macroscopic state equations and have shown that both a layered associative net and an autocorrelation type net have the same convergence property: If a recalling process succeeds, the network converges very fast to one of the memorized patterns. But if a recalling process fails, it converges very slowly to a spurious state or does not converge. This property was also checked by computer simulations on a large scale (N = 1000) neural network. Moreover, it is shown that the convergence time for a successful recall is of order log(N). If this convergence time difference is used, execution time and memory can be saved and it can be determined whether a recalling process succeeds or fails without any additional procedure.

Cite

Text

Tanaka and Yamada. "The Characteristics of the Convergence Time of Associative Neural Networks." Neural Computation, 1993. doi:10.1162/NECO.1993.5.3.463

Markdown

[Tanaka and Yamada. "The Characteristics of the Convergence Time of Associative Neural Networks." Neural Computation, 1993.](https://mlanthology.org/neco/1993/tanaka1993neco-characteristics/) doi:10.1162/NECO.1993.5.3.463

BibTeX

@article{tanaka1993neco-characteristics,
  title     = {{The Characteristics of the Convergence Time of Associative Neural Networks}},
  author    = {Tanaka, Toshiaki and Yamada, Miki},
  journal   = {Neural Computation},
  year      = {1993},
  pages     = {463-472},
  doi       = {10.1162/NECO.1993.5.3.463},
  volume    = {5},
  url       = {https://mlanthology.org/neco/1993/tanaka1993neco-characteristics/}
}