Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A Survey of Optimization by Building and Using Probabilistic Models
Computational Optimization and Applications
Using Optimal Dependency-Trees for Combinational Optimization
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
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
Drift and Scaling in Estimation of Distribution Algorithms
Evolutionary Computation
Does overfitting affect performance in estimation of distribution algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Diversity loss in general estimation of distribution algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
UMDAs for dynamic optimization problems
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A diversity maintaining population-based incremental learning algorithm
Information Sciences: an International Journal
Initial-population bias in the univariate estimation of distribution algorithm
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
Using over-sampling in a Bayesian classifier EDA to solve deceptive and hierarchical problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An ant-based rule for UMDA's update strategy
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems
Computers and Industrial Engineering
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
Estimation of distribution algorithms replace the typical crossover and mutation operators by constructing a probabilistic model and generating offspring according to this model. In previous studies, it has been shown that this generally leads to diversity loss due to sampling errors. In this paper, for the case of the simple Univariate Marginal Distribution Algorithm (UMDA), we propose and test several methods for counteracting diversity loss. The diversity loss can come in two phases: sampling from the probability model (offspring generation) and selection. We show that it is possible to completely remove the sampling error during offspring generation. Furthermore, we examine several plausible model construction variants which counteract diversity loss during selection and demonstrate that these update rules work better than the standard update on a variety of simple test problems.