Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2714))

Abstract

This paper proposes an innovative enhancement of the classical Hopfield network algorithm (and potentially its stochastic derivatives) with an “adaptation mechanism” to guide the neural search process towards high-quality solutions for large-scale static optimization problems. Specifically, a novel methodology that employs gradient-descent in the error space to adapt weights and constraint weight parameters in order to guide the network dynamics towards solutions is formulated. In doing so, a creative algebraic approach to define error values for each neuron without knowing the desired output values for the same is adapted.

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. Smith, K.: Neural Networks for Combinatorial Optimization: A Review of More Than A Decade of Research. INFORMS J. on Computing. 11 (1999) 15–34

    Article  MATH  Google Scholar 

  2. Hopfield, J. J., Tank, D. W.: Neural Computation of Decision in Optimization Problems. Biological Cybernetics. 52 (1985) 141–152

    MATH  MathSciNet  Google Scholar 

  3. Serpen, G., Parvin, A.: On the Performance of Hopfield Network for Graph Search Problem. Int. J. Neurocomputing. 14 (1997) 365–381

    Article  Google Scholar 

  4. Serpen, G., Livingston, D. L.: Determination of Weights for Relaxation Recurrent Neural Networks. Int. J. Neurocomputing. 34 (2000) 145–168

    Article  MATH  Google Scholar 

  5. Pineda, F. J.: Generalization of Back-Propagation to Recurrent Neural Networks. Physical Review Letters. 59 (1987) 2229–2232

    Article  MathSciNet  Google Scholar 

  6. Almeida, L. B.: A Learning Rule for Asynchronous Perceptrons with Feedback in a Combinatorial Environment. Proc. of IEEE 1st Int. Conf. on Neural Networks. San Diego, CA. (1987) 609–618

    Google Scholar 

  7. Werbos, P. J.: Generalization of Backpropagation with Application to A Recurrent Gas Market Model. Neural Networks. 1 (1988) 234–242

    Article  Google Scholar 

  8. Serpen, G., Livingston, D. L.: An Adaptive Constraint Satisfaction Network. Proc. ASILOMAR Conf. Signals, Systems and Circuits. Monterey, California. (1990) 163–167

    Google Scholar 

  9. Serpen, G., Patwardhan, A., Geib, J.: Simultaneous Recurrent Neural Network Addressing the Scaling Problem in Static Optimization. Neural Systems. 11 (2001) 477–487

    Google Scholar 

  10. OSC — Ohio Supercomputer Center, Columbus, Ohio, USA, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Serpen, G. (2003). Adaptive Hopfield Network. In: Kaynak, O., Alpaydin, E., Oja, E., Xu, L. (eds) Artificial Neural Networks and Neural Information Processing — ICANN/ICONIP 2003. ICANN ICONIP 2003 2003. Lecture Notes in Computer Science, vol 2714. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44989-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-44989-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40408-8

  • Online ISBN: 978-3-540-44989-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics