Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
The sciences of the artificial (3rd ed.)
The sciences of the artificial (3rd ed.)
Learning Bayesian networks with local structure
Learning in graphical models
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
Schemata, Distributions and Graphical Models in Evolutionary Optimization
Journal of Heuristics
Proceedings of the 5th International Conference on Genetic Algorithms
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
Does overfitting affect performance in estimation of distribution algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
Hierarchical BOA solves ising spin glasses and MAXSAT
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
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
Using previous models to bias structural learning in the hierarchical BOA
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Enhancing Efficiency of Hierarchical BOA Via Distance-Based Model Restrictions
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Real options approach to evaluating genetic algorithms
Applied Soft Computing
Combinatorial effects of local structures and scoring metrics in bayesian optimization algorithm
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Intelligent bias of network structures in the hierarchical BOA
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Mining probabilistic models learned by EDAs in the optimization of multi-objective problems
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Structure learning and optimisation in a Markov-network based estimation of distribution algorithm
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Analyzing the probability of the optimum in EDAs based on Bayesian networks
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Spurious dependencies and EDA scalability
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Sensibility of linkage information and effectiveness of estimated distributions
Evolutionary Computation
Estimation of distribution algorithms: from available implementations to potential developments
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Using previous models to bias structural learning in the hierarchical boa
Evolutionary Computation
| Hi-index | 0.00 |
The hierarchical Bayesian optimization algorithm (hBOA) can solve nearly decomposable and hierarchical problems of bounded difficulty in a robust and scalable manner by building and sampling probabilistic models of promising solutions. This paper analyzes probabilistic models in hBOA on two common test problems: concatenated traps and 2D Ising spin glasses with periodic boundary conditions. We argue that although Bayesian networks with local structures can encode complex probability distributions, analyzing these models in hBOA is relatively straightforward and the results of such analyses may provide practitioners with useful information about their problems. The results show that the probabilistic models in hBOA closely correspond to the structure of the underlying optimization problem, the models do not change significantly in subsequent iterations of BOA, and creating adequate probabilistic models by hand is not straightforward even with complete knowledge of the optimization problem.