Khaled M. S. Badran
ABSTRACT
It has been observed previously that genetic programming populations can collapse to all single node trees when a parsimony measure (tree node count) is used in a multiobjective setting. We have investigated the circumstances under which this can occur for both the 6-parity boolean learning task and a range of benchmark machine learning problems. We conclude that mutation is an important -- and we believe a hitherto unrecognized -- factor in preventing population collapse in multiobjective genetic programming; without mutation we routinely observe population collapse. From systematic variation of the mutation operator, we conclude that a necessary condition to avoid collapse is that mutation produces, on average, an increase in tree sizes (bloating) at each generation which is then counterbalanced by the parsimony pressure applied during selection. Finally, we conclude that the use of a genotype diversity preserving mechanism is ineffective at preventing population collapse.
- C. L. Blake and C. J. Merz. UCI Repository of Machine Learning Databases. http://www.ics.uci.edu/.mlearn/MLRepository.html 1998.Google Scholar
- S. Bleuler, M. Brack, L. Theile, and E. Zitzler. Multiobjective genetic programming:Reducing bloat using SPEA2. In Congress on Evolutionary Computation pages 536--543, Seoul, Korea, 2001. IEEE.Google ScholarCross Ref
- E. D. de Jong and J. B. Pollack. Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines 4(3):211--233, 2003. Google ScholarDigital Library
- A. Ekárt and S. Z. Németh. Selection based on the Pareto nondomination criterion for controlling code growth in genetic programming. Genetic Programming and Evolvable Machines 2(1):61--73, 2001. Google ScholarDigital Library
- P. J. Fleming. Personal communication, 2007.Google Scholar
- C. M. Fonseca and P. J. Fleming. Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In S. Forrest, editor, 5th International Conference of Genetic Algorithms pages 416--423, San Mateo, CA, 1993. Morgan Kaufmann. Google ScholarDigital Library
- T. Ito, H. Iba, andS. Sato. Non-destructive depth-dependent crossover for genetic programming. In 1st European Workshop on Genetic Programming pages 14--15, Paris, France, 1998. Springer-Verlag. Google ScholarDigital Library
- W. B. Langdon and J. P. Nordin. Seeding GP populations. In R. Poli, W. Banzhaf, W. B. Langdon, J. F. Miller, P. Nordin, and T. C. Fogarty, editors, 3rd European Conference on Genetic Programming (EuroGP'2000) pages 304--315, Edinburgh, 2000. Springer-Verlag. Google ScholarDigital Library
- W. B. Langdon and R. Poli. Fitness causes bloat: Mutation. In 1st European Workshop on Genetic Programming pages 37--48, Paris, France, 1998. Springer-Verlag. Google ScholarDigital Library
- T.-S. Lim, W.-Y. Loh, and Y.-S. Shih. A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classi . cation algorithms. Machine Learning 40(3):203--229, 2000. Google ScholarDigital Library
- R. Poli and W. B. Langdon. Genetic programming with one-point crossover and point mutation. Technical Report CSRP-97-13, Department of Computer Science, University of Birmingham, Birmingham, UK, 1997.Google Scholar
- K. Rodríguez-Vázquez, C. M. Fonseca, and P. J. Fleming. Identifying the structure of non-linear dynamic systems using multiobjective genetic programming. IEEE Transactions on Systems, Man and Cybernetics - Part A: Systems and Humans 34(4):531--547, 2004. Google ScholarDigital Library
- Y. Zhang and P. I. Rockett. Evolving optimal feature extraction using multi-objective genetic programming: A methodology and preliminary study on edge detection. In H.-G. Beyer, U.-M. O'Reilly, D. V. Arnold, W. Banzhaf, C. Blum, E. W. Bonabeaum, E. Cantu-Paz, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, M. Pelikan, G. R. Raidl, T. Soule, A. M. Tyrrell, J.-P. Watson, and E. Zitzler, editors, Genetic and Evolutionary Computation Conference (GECCO 2005) pages 795--802, Washington, DC, 2005. ACM Press. Google ScholarDigital Library
- Y. Zhang and P. I. Rockett. Feature extraction using multi-objective genetic programming. In Y. Jin, editor, Multi-Objective Machine Learning Springer, Heidelberg, 2006.Google ScholarCross Ref
Index Terms
- The roles of diversity preservation and mutation in preventing population collapse in multiobjective genetic programming
Recommendations
The influence of mutation on population dynamics in multiobjective genetic programming
Using multiobjective genetic programming with a complexity objective to overcome tree bloat is usually very successful but can sometimes lead to undesirable collapse of the population to all single-node trees. In this paper we report a detailed ...
A dual-population genetic algorithm for adaptive diversity control
A variety of previous works exist on maintaining population diversity of genetic algorithms (GAs). Dual-population GA (DPGA) is a type of multipopulation GA (MPGA) that uses an additional population as a reservoir of diversity. The main population is ...
Multiobjective real-coded bayesian optimization algorithmrevisited: diversity preservation
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationThis paper provides empirical studies on MrBOA, which have been designed for strengthening diversity of nondominated solutions. The studies lead to modified sharing. A new selection scheme has been suggested for improving diversity performance. ...
Comments