Finding ground states of Sherrington-Kirkpatrick spin glasses with hierarchical BOA and genetic algorithms

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 447-454

  Pelikan, Martin ^a   Katzgraber, Helmut G ^b   Kobe, Sigismund ^c  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^b ETH ZURICH   (Switzerland)

^c DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Algorithms; Performance

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; GLASS; SPIN GLASS;

CROSSOVER OPERATOR; GLOBALOPTIMUM; HIERARCHICAL BAYESIAN OPTIMIZATION ALGORITHMS; PERFORMANCE; PROBLEM INSTANCES; RANDOM INSTANCE; SPIN-GLASS MODELS; TIME COMPLEXITY;

GROUND STATE;

EID: 57349105061     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389176     Document Type: Conference Paper

References (47)

1. T. Aspelmeier, M. A. Moore, and A. P. Young. Interface energies in Ising spin glasses. Phys. Rev. Lett., 90:127202, 2003.
2. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994.
3. F. Barahona. On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical, Nuclear and General, 15(10):3241-3253, 1982.
4. A. Billoire. Some aspects of infinite range models of spin glasses: theory and numerical simulations. (arXiv:cond-mat/0709.1552), 2007.
5. K. Binder and A. P. Young. Spin glasses: Experimental facts, theoretical concepts and open questions. Rev. Mod. Phys., 58:801, 1986.
6. S. Boettcher. Extremal optimization for Sherrington-Kirkpatrick spin glasses. Eur. Phys. J. B, 46:501-505, 2005.
7. J.-P. Bouchaud, F. Krzakala, and O. C. Martin. Energy exponents and corrections to scaling in Ising spin glasses. Phys. Rev. B, 68:224404, 2003.
8. D. M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA, 1997.
9. G. F. Cooper and E. H. Herskovits. A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9:309-347, 1992.
10. A. Crisanti, G. Paladin, and H.-J. S. A. Vulpiani. Replica trick and fluctuations in disordered systems. J. Phys. I, 2:1325-1332, 1992.
11. N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421-459. MIT Press, Cambridge, MA, 1999.
12. D. E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, 1989.
13. G. Harik and F. Lobo. A parameter-less genetic algorithm. Proc. of the Genetic and Evolutionary Computation Conference (GECCO-99), I:258-265, 1999.
14. G. R. Harik. Finding multimodal solutions using restricted tournament selection. Proc. of the Int. Conference on Genetic Algorithms (ICGA-95), pages 24-31, 1995.
15. A. Hartwig, F. Daske, and S. Kobe. A recursive branch-and-bound algorithm for the exact ground state of Ising spin-glass models. Computer Physics Communications, 32:133-138, 1984.
16. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975.
17. R. Höns. Estimation of Distribution Algorithms and Minimum Relative Entropy. PhD thesis, University of Bonn, Germany, 2005.
18. K. Hukushima and K. Nemoto. Exchange Monte Carlo method and application to spin glass simulations. J. Phys. Soc. Jpn., 65:1604, 1996.
19. H. G. Katzgraber. Spin glasses and algorithm benchmarks: A one-dimensional view. In Proc. of the International Workshop on Statistical-Mechanical Informatics, 2007.
20. H. G. Katzgraber, M. Körner, F. Liers, M. Jünger, and A. K. Hartmann. Universality-class dependence of energy distributions in spin glasses. Phys. Rev. B, 72:094421, 2005.
21. N. Kawashima and H. Rieger. Recent Progress in Spin Glasses. 2003. (cond-mat/0312432).
22. S. Kirkpatrick and D. Sherrington. Infinite-ranged models of spin-glasses. Phys. Rev. B, 17(11):4384-4403, Jun 1978.
23. S. Kobe. Ground-state energy and frustration of the Sherrington- Kirkpatrick model and related models. ArXiv Condensed Matter e-print cond-mat/03116570, University of Dresden, 2003.
24. S. Kobe and A. Hartwig. Exact ground state of finite amorphous Ising systems. Computer Physics Communications, 16:1-4, 1978.
25. M. Körner, H. G. Katzgraber, and A. K. Hartmann. Probing tails of energy distributions using importance-sampling in the disorder with a guiding function. J. Stat. Mech., P04005, 2006.
26. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.
27. M. Mézard, G. Parisi, and M. A. Virasoro. Spin Glass Theory and Beyond. World Scientific, Singapore, 1987.
28. J. J. Moreno, H. G. Katzgraber, and A. K. Hartmann. Finding low-temperature states with parallel tempering, simulated annealing and simple Monte Carlo. Int. J. Mod. Phys. C, 14:285, 2003.
29. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187, 1996.
30. K. F. Pal. The ground state energy of the Edwards-Anderson Ising spin glass with a hybrid genetic algorithm. Physica A, 223(3-4):283-292, 1996.
31. K. F. Pal. Hysteretic optimization for the Sherrington Kirkpatrick spin glass. Physica A, 367:261-268, 2006.
32. M. Palassini. Ground-state energy fluctuations in the Sherrington-Kirkpatrick model. 2003. (cond-mat/0307713).
33. G. Parisi. Infinite number of order parameters for spin-glasses. Phys. Rev. Lett., 43:1754, 1979.
34. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005.
35. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Proc. of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 511-518, 2001.
36. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
37. M. Pelikan, D. E. Goldberg, and K. Sastry. Bayesian optimization algorithm, decision graphs, and Occam's razor. Proc. of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 519-526, 2001.
38. M. Pelikan and A. K. Hartmann. Searching for ground states of Ising spin glasses with hierarchical BOA and cluster exact approximation. In E. Cantú-Paz, M. Pelikan, and K. Sastry, editors, Scalable optimization via probabilistic modeling: From algorithms to applications, pages 333-349. Springer, 2006.
39. M. Pelikan, J. Ocenasek, S. Trebst, M. Troyer, and F. Alet. Computational complexity and simulation of rare events of ising spin glasses. Proc. of the Genetic and Evolutionary Computation Conference (GECCO-2004), 2:36-47, 2004.
40. M. Pelikan, K. Sastry, and D. E. Goldberg. Sporadic model building for efficiency enhancement of hBOA. Proc. of the Genetic and Evolutionary Computation Conference (GECCO-2006), 2006.
41. R. Santana. Estimation of distribution algorithms with Kikuchi approximations. Evolutionary Computation, 13(1):67-97, 2005.
42. K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
43. K. Sastry, M. Pelikan, and D. E. Goldberg. Efficiency enhancement of estimation of distribution algorithms. In M. Pelikan, K. Sastry, and E. Cantú-Paz, editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pages 161-185. Springer, 2006.
44. S. K. Shakya, J. A. McCall, and D. F. Brown. Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields. Proc. of the IEEE Congress on Evolutionary Computation (CEC 2006), pages 908-915, 2006.
45. E. A. Smorodkina and D. R. Tauritz. Greedy population sizing for evolutionary algorithms. IEEE Congress on Evolutionary Computation (CEC 2007), pages 2181-2187, 2007.
46. M. Talagrand. The Parisi formula. Ann. of Math., 163:221, 2006.
47. D. Thierens, D. E. Goldberg, and A. G. Pereira. Domino convergence, drift, and the temporal-salience structure of problems. Proc. of the Int. Conference on Evolutionary Computation (ICEC-98), pages 535-540, 1998.