Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
The sciences of the artificial (3rd ed.)
The sciences of the artificial (3rd ed.)
Learning Bayesian networks with local structure
Learning in graphical models
Detecting spin-flip symmetry in optimization problems
Theoretical aspects of evolutionary computing
Efficient and Accurate Parallel Genetic Algorithms
Efficient and Accurate Parallel Genetic Algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
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
Modeling Building-Block Interdependency
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The Effect of Spin-Flip Symmetry on the Performance of the Simple GA
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
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
Bayesian optimization algorithm: from single level to hierarchy
Bayesian optimization algorithm: from single level to hierarchy
New Optimization Algorithms in Physics
New Optimization Algorithms in Physics
Phase Transitions in Combinatorial Optimization Problems - Basics, Algorithms and Statistical Mechanics
Combining competent crossover and mutation operators: a probabilistic model building approach
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Estimation of Distribution Algorithms with Kikuchi Approximations
Evolutionary Computation
Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence)
The gambler's ruin problem, genetic algorithms, and the sizing of populations
Evolutionary Computation
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Evolutionary Computation
Design of multithreaded estimation of distribution algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Hierarchical BOA solves ising spin glasses and MAXSAT
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
On the sample complexity of learning Bayesian networks
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Substructural neighborhoods for local search in the bayesian optimization algorithm
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Parallel Implementation of EDAs Based on Probabilistic Graphical Models
IEEE Transactions on Evolutionary Computation
Combinatorial effects of local structures and scoring metrics in bayesian optimization algorithm
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Correlation guided model building
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Effective linkage learning using low-order statistics and clustering
IEEE Transactions on Evolutionary Computation - Special issue on evolutionary algorithms based on probabilistic models
Improving the scalability of EA techniques: a case study in clustering
EA'09 Proceedings of the 9th international conference on Artificial evolution
A priori knowledge integration in evolutionary optimization
EA'09 Proceedings of the 9th international conference on Artificial evolution
Graph clustering based model building
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Learning factorizations in estimation of distribution algorithms using affinity propagation
Evolutionary Computation
A review on probabilistic graphical models in evolutionary computation
Journal of Heuristics
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 |
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algorithms and that is why this research area represents an important niche of evolutionary computation. This paper describes and analyzes sporadic model building, which can be used to enhance the efficiency of the hierarchical Bayesian optimization algorithm (hBOA) and other estimation of distribution algorithms (EDAs) that use complex multivariate probabilistic models. With sporadic model building, the structure of the probabilistic model is updated once in every few iterations (generations), whereas in the remaining iterations, only model parameters (conditional and marginal probabilities) are updated. Since the time complexity of updating model parameters is much lower than the time complexity of learning the model structure, sporadic model building decreases the overall time complexity of model building. The paper shows that for boundedly difficult nearly decomposable and hierarchical optimization problems, sporadic model building leads to a significant model-building speedup, which decreases the asymptotic time complexity of model building in hBOA by a factor of $$\Uptheta(n^{0.26})$$ to $$\Uptheta(n^{0.5}),$$ where n is the problem size. On the other hand, sporadic model building also increases the number of evaluations until convergence; nonetheless, if model building is the bottleneck, the evaluation slowdown is insignificant compared to the gains in the asymptotic complexity of model building. The paper also presents a dimensional model to provide a heuristic for scaling the structure-building period, which is the only parameter of the proposed sporadic model-building approach. The paper then tests the proposed method and the rule for setting the structure-building period on the problem of finding ground states of 2D and 3D Ising spin glasses.