A Generalized Convergence Theorem for Neural Networks

IEEE Transactions on Information Theory

Volumn 34, Issue 5, 1988, Pages 1089-1092

  Bruck, Jehoshua ^a   Goodman, Joseph W ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--THRESHOLD LOGIC; DATA STORAGE, DIGITAL--ASSOCIATIVE; MATHEMATICAL TECHNIQUES--CONVERGENCE OF NUMERICAL METHODS;

ASSOCIATIVE MEMORY DEVICES; COMBINATORIAL OPTIMIZATION; CONVERGENCE THEOREMS; THRESHOLD LOGIC FUNCTION;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0024078743     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.21239     Document Type: Article

References (7)

1. J. Bruck and J. Sanz, “A study on neural networks,” IBM ARC, Computer Science, RJ 5403, 1986. Also in Int. J. Intelligent Syst., vol. 3, pp. 59–75, 1988.
2. M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
3. E. Goles, F. Fogelman, and D. Pellegrin, “Decreasing energy functions as a tool for studying threshold networks,” Disc. Appl. Math., vol. 12, pp. 261–277, 1985.
4. P. L. Hammer and S. Rudeanu, Boolean Methods in Operations Research. New York: Springer-Verlag, 1968.
5. J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” in Proc. Nat. Acad. Sci. USA, vol. 79, pp. 2554–2558, 1982.
6. J. J. Hopfield and D. W. Tank, “Neural computations of decisions in optimization problems,” Biol. Cybern., vol. 52, pp. 141–152, 1985.
7. J. C. Picard and H. D. Ratliff, “Minimum cuts and related problems,” Networks, vol. 5, pp. 357–370, 1974.