ABSTRACT
A Cultural Algorithm (CA) is an evolutionary algorithm augmented by a machine learner. The machine learner updates a knowledgebase with each generation based on bes and least fit individuals. Using a stochastic selection operator may eliminate critical "best" and "worst" individuals via genetic drift thus radically changing the inferred rules. The new rules may be so different from the previous generation as to switch the convergence trajectory to a different optimum. Overall performance may be severely impaired by this optima "thrashing" from generation to generation. This research demonstrates this phenomena using a variant of a CA, Learnable Evolution Model, on a simple problem. The performance between truncation survival selection and binary tournament survival selection operators is compared. It was expected that the latter survival selection operator would introduce pathological effects due to genetic drift because of its stochastic nature. Comparatively binary tournament selection converged more slowly, had larger convergence variations, and converged to inferior solutions than truncation selection. Practitioners that use evolutionary algorithm/machine learner hybrids need to be aware of this problem. Selection operators will have to be judiciously chosen accordingly to avoid deleterious effects of genetic drift on the machine learning component.
- Thomas Bäck, Ulrich Hammel, and Hans-Paul Schwefel. Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation, 1(1):3--17, Apr. 1997. Google ScholarDigital Library
- David B. Fogel. An Introduction to Simulated Evolutionary Optimization. IEEE Transactions on Neural Networks, 5(1):3-14, Jan. 1994.Google ScholarDigital Library
- Robert G. Reynolds. New ideas in optimization, chapter Cultural algorithms: theory and applications, pages 367--378. McGraw-Hill Ltd., UK, Maidenhead, UK, England, 1999. Google ScholarDigital Library
- R.S. Michalski. Machine Learning, volume 38, chapter LEARNABLE EVOLUTION MODEL: Evolutionary Processes Guided by Machine Learning, pages 9--40. Kluwer Academic Publishers, 2000. Google ScholarDigital Library
- J.R. Quinlan. C4.5, Programs for Machine Learning. Morgan Kaufmann Publishers, 1993. Google ScholarDigital Library
- M. Coletti, T. Lash, C. Mandsager, and R.S. Michalski. Comparing Performance of the Learnable Evolution Model and Genetic Algorithms on Problems in Digital Signal Filter Design. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Orlando, Florida, July 1999.Google Scholar
- Kenneth De Jong. Evolutionary Computation: a unified approach. The MIT Press, 55 Hayward St., Cambridge, MA 02142, 2006.Google Scholar
Index Terms
- Learnable evolution model performance impaired by binary tournament survival selection
Recommendations
The effects of training set size and keeping rules on the emergent selection pressure of learnable evolution model
GECCO '12: Proceedings of the 14th annual conference companion on Genetic and evolutionary computationEvolutionary algorithms with computationally expensive fitness evaluations typically have smaller evaluation budgets and population sizes. However, smaller populations and fewer evaluations mean that the problem space may not be effectively explored. An ...
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computationLearnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type of operators for creating new individuals, specifically, hypothesis ...
Estimation of fitness landscape contours in EAs
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationEvolutionary algorithms applied in real domain should profit from information about the local fitness function curvature. This paper presents an initial study of an evolutionary strategy with a novel approach for learning the covariance matrix of a ...
Comments