Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article
Open access

On the interconnection constants of Hopfield nets

Published: 01 March 1990 Publication History

Abstract

Hopfield nets are a class of neural networks that are often applied to optimisation problems. The role played by certain constants appearing in the interconnections are crucial to the computations. A bad choice of constant values results in the convergence of the system to states that represent extraneous results. This paper examines a discrete model of the nets which allows a better characterisation of the constants. The formal approach followed in this paper allows the specification of values to the constants that ensure convergence of the system to states that represent results that are not extraneous. Using the Hopfield nets terminology, we have identified methods to remove extraneous energy minima in the discrete version of the system. Since any simulation study of Hopfield nets on real computers must use discretised approximations to analog values, the results are of interest in a practical domain as well.

References

References

[1]
Garey M. R. and Johnson D. S. Computers and Intractability 1979 New York Freeman
[2]
Hopfield J. J. Neural Networks and Physical Systems with Emergent Collective Computational Abilities Proc. Natl. Acad. Sci. USA 1982 79 2554-2558
[3]
Hopfield J. J. Neurons with Graded Response have Collective Computational Properties like Those of Two-State Neurons Proc. Natl. Acad. Sci. USA 1984 81 3088-3092
[4]
Hopfield J. J. and Tank D. W. “Neural” Computation of Decisions in Optimization Problems Biol. Cybern. 1985 52 141-152
[5]
Hopfield J. J. and Tank D. W. Computing with Nerual Circuits: A Model Science 1986 233 625-633
[6]
McCulloch W. S. and Pitts W. Bull. Math. Biophys. 1943 5 115-133
[7]
Pearl, J.:Heuristics: Intelligent Search Strategies for Computer Problem Solving, pp. 33–72, Addison-Wesley, 1984.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing
Formal Aspects of Computing  Volume 2, Issue 1
Mar 1990
395 pages
ISSN:0934-5043
EISSN:1433-299X
Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Revision received: 15 June 1990
Published: 01 March 1990
Received: 15 August 1989
Published in FAC Volume 2, Issue 1

Author Tags

  1. Neural networks
  2. Energy minimisation
  3. Search
  4. Extraneous results
  5. Formal methods

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 49
    Total Downloads
  • Downloads (Last 12 months)32
  • Downloads (Last 6 weeks)9
Reflects downloads up to 01 Dec 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media