Skip to main content
Springer Nature Link
Log in

Analyzing Boltzmann Machine Parameters for Fast Convergence

  • Conference paper
  • First Online:
Bio-Inspired Applications of Connectionism (IWANN 2001)

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

Included in the following conference series:

  • 447 Accesses

Abstract

The behavior of a Boltzmann Machine (BM) according to changes in the parameters that determine its convergence is experimentally analyzed to find a way to accelerate the convergence towards a solution for the given optimization problem. The graph colouring problem has been chosen as a benchmark for which convergence with quadratic time complexity has been obtained.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Aarts, E.H.L., Korst, J.H.M.: Simulated Annealing and Boltzmann Machines. Wiley, New York (1989)

    MATH  Google Scholar 

  2. Chow, F., Hennessy, J.: Register Allocation by Priority-Based Colouring. Proceedings of the ACM SIGPLAN’ 84. Symposium on Compiler Construction SIGPLAN Notices, vol. 19,num.6, (June 1984)

    Google Scholar 

  3. Ortega, J., and others: Parallel Coarse Grain Computing of Boltzmann Machines. Neural Processing Letters 7: 169–184, (1998)

    Article  Google Scholar 

  4. Kappen, H.J., Rodríguez, F.B.: Efficient Learning in Boltzmann Machines Using Linear Response Theory. Neural Computation 10(5): 1137–1156, (1998)

    Article  Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. Freeman (1979)

    Google Scholar 

  6. Zissimopoulos, V., Paschos, V.Th., Pekergin, F.:On the Approximation of NP-Complete Problems by Using the Bolzmann Machine Method: The Cases of Some Covering and Packing Problems. IEEE Transactions on Computers, vol. 40,num. 12, (December 1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Architecture and Technology, University of Granada, Spain

    Fco. Javier Salcedo, Julio Ortega & Alberto Prieto

Authors
  1. Fco. Javier Salcedo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Julio Ortega
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alberto Prieto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Inteligencia Artificial, Universidad Nacional de Educación a Distancia, Senda del Rey, s/n., 28040, Madrid, Spain

    José Mira

  2. Departamento de Arquitectura y Tecnología de Computadores, Universidad de Granada, Campus Fuentenueva, 18071, Granada, Spain

    Alberto Prieto

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Javier Salcedo, F., Ortega, J., Prieto, A. (2001). Analyzing Boltzmann Machine Parameters for Fast Convergence. In: Mira, J., Prieto, A. (eds) Bio-Inspired Applications of Connectionism. IWANN 2001. Lecture Notes in Computer Science, vol 2085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45723-2_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45723-2_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42237-2

  • Online ISBN: 978-3-540-45723-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation