• DocumentCode
    2114472
  • Title

    The tight upper bound on the number of stationary points in Hopfield networks

  • Author

    Shrivastava, Yash ; Dasgupta, Soura

  • Author_Institution
    Center for Ind. Control Syst., Newcastle, NSW, Australia
  • fYear
    1993
  • fDate
    15-17 Dec 1993
  • Firstpage
    3682
  • Abstract
    This paper derives the tight upper bound on the number of stationary points that an nth order Hopfield network can have, and provides a characterization of synaptic sign patterns that allow a network to achieve this capacity. We show that nC[n/2] is the tight upper bound on the number of stationary points of an n-order Hopfield network. A simple graph theoretic characterization of the maximum capacity networks is given
  • Keywords
    Hopfield neural nets; graph theory; Hopfield networks; digraph; nonpositive networks; stationary points; synaptic sign patterns; tight upper bound; Associative memory; Cities and towns; Couplings; Error correction; Intelligent networks; Neurons; Tiles; USA Councils; Upper bound; Vehicles;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on
  • Conference_Location
    San Antonio, TX
  • Print_ISBN
    0-7803-1298-8
  • Type

    conf

  • DOI
    10.1109/CDC.1993.325904
  • Filename
    325904
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2114472