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

Y Shrivastava; S Dasgupta

doi:10.1109/CDC.1993.325904

Back

Conference proceeding

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

Y Shrivastava and S Dasgupta

Proceedings of 32nd IEEE Conference on Decision and Control, Vol.4, pp.3682-3687 vol.4

IEEE Conference on Decision and Control, 32 (San Antonio, Texas, 12/15/1993 - 12/17/1993)

1993

DOI: 10.1109/CDC.1993.325904

View Online

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.< >

Neurons

Associative memory

Cities and towns

Couplings

Error correction

Intelligent networks

Tiles

Upper bound

USA Councils

Vehicles

Details

Title: Subtitle: The tight upper bound on the number of stationary points in Hopfield networks
Creators: Y Shrivastava - Center for Ind. Control Syst., Newcastle, NSW, Australia
S Dasgupta
Resource Type: Conference proceeding
Publication Details: Proceedings of 32nd IEEE Conference on Decision and Control, Vol.4, pp.3682-3687 vol.4
Conference: IEEE Conference on Decision and Control, 32 (San Antonio, Texas, 12/15/1993 - 12/17/1993)
Publisher: IEEE
DOI: 10.1109/CDC.1993.325904
ISSN: 0191-2216
Language: English
Date published: 1993
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984197917802771

Metrics

4 Record Views