Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Finding Multimodal Solutions Using Restricted Tournament Selection
Proceedings of the 6th International Conference on Genetic Algorithms
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning
Sporadic model building for efficiency enhancement of hierarchical BOA
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Analyzing probabilistic models in hierarchical BOA on traps and spin glasses
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Hybrid evolutionary algorithms on minimum vertex cover for random graphs
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Empirical analysis of ideal recombination on random decomposable problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
EvoBIO'07 Proceedings of the 5th European conference on Evolutionary computation, machine learning and data mining in bioinformatics
Substructural neighborhoods for local search in the bayesian optimization algorithm
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Performance of evolutionary algorithms on random decomposable problems
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Distance-based bias in model-directed optimization of additively decomposable problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Transfer learning, soft distance-based bias, and the hierarchical BOA
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
| Hi-index | 0.00 |
This paper analyzes the effects of restricting probabilistic models in the hierarchical Bayesian optimization algorithm (hBOA) by defining a distance metric over variables and disallowing dependencies between variables at distances greater than a given threshold. We argue that by using prior problem-specific knowledge, it is often possible to develop a distance metric that closely corresponds to the strength of interactions between variables. This distance metric can then be used to speed up model building in hBOA. Three test problems are considered: 3D Ising spin glasses, random additively decomposable problems, and the minimum vertex cover.