Hierarchical BOA, cluster exact approximation, and Ising spin glasses
27 September 2006Pelikan, M., Hartmann, A. K., and Sastry, K. (2006). Parallel Problem Solving From Nature (PPSN IX) . 121—131.
Abstract:
This paper analyzes the hierarchical Bayesian optimization algorithm (hBOA) on the problem of finding ground states of Ising spin glasses with ±J couplings in two and three dimensions. The performance of hBOA is compared to that of the simple genetic algorithm (GA) and the univariate marginal distribution algorithm (UMDA). The performance of all tested algorithms is improved by incorporating a deterministic hill climber (DHC) based on single-bit flips and cluster exact approximation (CEA). The results show that hBOA significantly outperforms GA and UMDA with both types of local search and that CEA enables all tested algorithms to solve larger spin-glass instances than DHC. Using advanced hybrid methods created by combining competent genetic and evolutionary algorithms with advanced local searchers thus proves advantageous in this challenging class of problems.
Related Posts:
- Analyzing probabilistic models in hierarchical BOA on traps and spin glasses
- Analyzing probabilistic models in hierarchical BOA on traps and spin glasses
- Sporadic model building for efficiency enhancement of the hierarchical BOA
- Efficient cluster optimization using a hybrid extended compact genetic algorithm with a seeded population
- Using previous models to bias structural learning in the hierarchical BOA
No comments yet
