Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
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
Efficient Linkage Discovery by Limited Probing
Evolutionary Computation
Linkage identification based on epistasis measures to realize efficient genetic algorithms
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Overcoming hierarchical difficulty by hill-climbing the building block structure
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Fda -a scalable evolutionary algorithm for the optimization of additively decomposed functions
Evolutionary Computation
Linkage identification by non-monotonicity detection for overlapping functions
Evolutionary Computation
Hi-index | 0.00 |
A simple parameter-less local optimizer able to solve deterministic problems with building blocks of bounded order is proposed in this article. The algorithm is able to learn and use linkage information during the run. The algorithm is algorithmically simple, easy to implement and with the exception of termination condition, it is completely parameter-free---there is thus no need to tune the population size and other parameters to the problem at hand. An empirical comparison on 3 decomposable functions, each with uniformly scaled building blocks of size 5 and 8, was carried out. The algorithm exhibits quadratic scaling with the problem dimensionality, but the comparison with the extended compact genetic algorithm and Bayesian optimization algorithm shows that it needs lower or comparable number of fitness function evaluations on the majority of functions for the tested problem dimensionalities. The results also suggest that the efficiency of the local optimizer compared to both the estimation-of-distribution algorithms should be better for problem sizes under at least a few hundreds of bits.