Skip to main content

Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix

  • Conference paper
Artificial Neural Networks – ICANN 2010 (ICANN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6354))

Included in the following conference series:

Abstract

The local minima of a quadratic functional depending on binary variables are discussed. An arbitrary connection matrix can be presented in the form of quasi-Hebbian expansion where each pattern is supplied with its own individual weight. For such matrices statistical physics methods allow one to derive an equation describing local minima of the functional. A model where only one weight differs from other ones is discussed in details. In this case the equation can be solved analytically. Obtained results are confirmed by computer simulations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amit, D., Gutfreund, H., Sompolinsky, H.: Statistical Mechanics of Neural Networks Near Saturation. Annals of Physics 173, 30–67 (1987)

    Article  Google Scholar 

  2. Hertz, J., Krogh, A., Palmer, R.: Introduction to the Theory of Neural Computation. Addison-Wesley, New York (1991)

    Google Scholar 

  3. Kryzhanovsky, B.V.: Expansion of a matrix in terms of external products of configuration vectors. Optical Memory & Neural Networks (Information Optics) 16(4), 187–199 (2007)

    Google Scholar 

  4. Frolov, A.A., Husek, D., Muraviev, I.P.: Informational efficiency of sparsely encoded Hopfield-like autoassociative memory. Optical Memory & Neural Networks (Information Optic) 12(3), 177–197 (2004)

    Google Scholar 

  5. van Hemmen, J.L., Kuhn, R.: Collective Phenomena in Neural Networks. In: Domany, E., van Hemmen, J.L., Shulten, K. (eds.) Models of Neural Networks, Springer, Berlin (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karandashev, Y., Kryzhanovsky, B., Litinskii, L. (2010). Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix. In: Diamantaras, K., Duch, W., Iliadis, L.S. (eds) Artificial Neural Networks – ICANN 2010. ICANN 2010. Lecture Notes in Computer Science, vol 6354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15825-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15825-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15824-7

  • Online ISBN: 978-3-642-15825-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics