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 n/sup C//sub [/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. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
