Substructural neighborhoods for local search in the Bayesian optimization algorithm
27 September 2006Lima, C. F., Pelikan, M., Sastry, K., Butz, M., Goldberg, D. E., Lobo, F. G. (2006). Parallel Problem Solving From Nature (PPSN IX) . 232—241. [Full paper - PDF] [Full paper - PS] .
Abstract:
This paper studies the utility of using substructural neighborhoods for local search in the Bayesian optimization algorithm (BOA). The probabilistic model of BOA, which automatically identifies important problem substructures, is used to define the structure of the neighborhoods used in local search. Additionally, a surrogate fitness model is considered to evaluate the improvement of the local search steps. The results show that performing substructural local search in BOA significatively reduces the number of generations necessary to converge to optimal solutions and thus provides substantial speedups.
Related Posts:
- Scalability of the Bayesian optimization algorithm
- Evolutionary algorithms + graphical models = scalable black-box optimization
- Bayesian optimization algorithm, decision graphs, and Occam’s razor
- Hierarchical BOA, cluster exact approximation, and Ising spin glasses
- iBOA: The incremental Bayesian optimization algorithm
No comments yet
