ABSTRACT
Lexicase selection is a parent selection method that has been shown to improve the problem solving power of genetic programming over a range of problems. Previous work has shown that it can also produce hyperselection events, in which a single individual is selected many more times than other individuals. Here we investigate the role that hyperselection plays in the problem-solving performance of lexicase selection. We run genetic programming on a set of program synthesis benchmark problems using lexicase and tournament selection, confirming that hyperselection occurs significantly more often and more drastically with lexicase selection, which also performs significantly better. We then show results from an experiment indicating that hyperselection is not integral to the problem-solving performance or diversity maintenance observed when using lexicase selection. We conclude that the power of lexicase selection stems from the collection of individuals that it selects, not from the unusual frequencies with which it sometimes selects them.
- T. Back. Selective pressure in evolutionary algorithms: a characterization of selection mechanisms. In Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence., Proceedings of the First IEEE Conference on, pages 57--62 vol.1, Jun 1994.Google ScholarCross Ref
- T. Blickle and L. Thiele. A mathematical analysis of tournament selection. In Proceedings of the 6th International Conference on Genetic Algorithms, pages 9--16, San Francisco, CA, USA, 1995. Morgan Kaufmann Publishers Inc. Google ScholarDigital Library
- J. E. Fieldsend and A. Moraglio. Strength through diversity: Disaggregation and multi-objectivisation approaches for genetic programming. In GECCO '15: Proceedings of the 2015 conference on Genetic and evolutionary computation. ACM, 2015. Google ScholarDigital Library
- E. Galván-López, B. Cody-Kenny, L. Trujillo, and A. Kattan. Using semantics in the selection mechanism in genetic programming: A simple method for promoting semantic diversity. In L. G. de la Fraga, editor, 2013 IEEE Conference on Evolutionary Computation, volume 1, pages 2972--2979, Cancun, Mexico, June 20--23 2013.Google ScholarCross Ref
- T. Helmuth. General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases. Ph.D. dissertation, 2015.Google Scholar
- T. Helmuth, N. F. McPhee, and L. Spector. Lexicase selection for program synthesis: a diversity analysis. In Genetic Programming Theory and Practice XIII, Genetic and Evolutionary Computation. Springer.Google Scholar
- T. Helmuth and L. Spector. General program synthesis benchmark suite. In GECCO '15: Proceedings of the 2015 Conference on Genetic and Evolutionary Computation, July 2015. Google ScholarDigital Library
- T. Helmuth, L. Spector, and J. Matheson. Solving uncompromising problems with lexicase selection. IEEE Transactions on Evolutionary Computation, 19(5):630--643, Oct. 2015.Google ScholarDigital Library
- K. Krawiec and P. Lichocki. Using co-solvability to model and exploit synergetic effects in evolution. In PPSN 2010 11th International Conference on Parallel Problem Solving From Nature, volume 6239 of Lecture Notes in Computer Science, pages 492--501, Krakow, Poland, 11--15 Sept. 2010. Springer. Google ScholarDigital Library
- K. Krawiec and P. Liskowski. Automatic derivation of search objectives for test-based genetic programming. In 18th European Conference on Genetic Programming, volume 9025 of LNCS, pages 53--65, Copenhagen, 8--10 Apr. 2015. Springer.Google ScholarCross Ref
- K. Krawiec, J. Swan, and U.-M. O'Reilly. Behavioral program synthesis: Insights and prospects. In Genetic Programming Theory and Practice XIII, Genetic and Evolutionary Computation. Springer, 2015.Google Scholar
- P. Liskowski, K. Krawiec, T. Helmuth, and L. Spector. Comparison of semantic-aware selection methods in genetic programming. In GECCO 2015 workshop on Semantic Methods in Genetic Programming. ACM, 2015. Google ScholarDigital Library
- R. I. McKay. Fitness sharing in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 435--442, Las Vegas, Nevada, USA, 10--12 July 2000. Morgan Kaufmann. Google ScholarDigital Library
- N. F. McPhee, D. Donatucci, and T. Helmuth. Using graph databases to explore the dynamics of genetic programming runs. In Genetic Programming Theory and Practice XIII, Genetic and Evolutionary Computation. Springer.Google Scholar
- L. Spector. Assessment of problem modality by differential performance of lexicase selection in genetic programming: A preliminary report. In 1st workshop on Understanding Problems (GECCO-UP), pages 401--408, Philadelphia, Pennsylvania, USA, 7--11 July 2012. ACM. Google ScholarDigital Library
- L. Spector and T. Helmuth. Uniform linear transformation with repair and alternation in genetic programming. In Genetic Programming Theory and Practice XI, Genetic and Evolutionary Computation, chapter 8, pages 137--153. Springer, Ann Arbor, USA, 9--11 May 2013.Google Scholar
- L. Spector, J. Klein, and M. Keijzer. The Push3 execution stack and the evolution of control. In GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 1689--1696, Washington DC, USA, 2005. ACM Press. Google ScholarDigital Library
- L. Spector and A. Robinson. Genetic programming and autoconstructive evolution with the push programming language. Genetic Programming and Evolvable Machines, 3(1):7--40, Mar. 2002. Google ScholarDigital Library
Index Terms
The Impact of Hyperselection on Lexicase Selection
Recommendations
Lexicase selection in learning classifier systems
GECCO '19: Proceedings of the Genetic and Evolutionary Computation ConferenceThe lexicase parent selection method selects parents by considering performance on individual data points in random order instead of using a fitness function based on an aggregated data accuracy. While the method has demonstrated promise in genetic ...
Effects of Lexicase and Tournament Selection on Diversity Recovery and Maintenance
GECCO '16 Companion: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference CompanionIn genetic programming systems, parent selection algorithms select the programs from which offspring will be produced by random variation and recombination. While most parent selection algorithms select programs on the basis of aggregate performance on ...
Specialization and elitism in lexicase and tournament selection
GECCO '18: Proceedings of the Genetic and Evolutionary Computation Conference CompanionPrior work has demonstrated that genetic programming systems often maintain higher levels of population diversity when using lexicase selection than when using other parent selection methods, and that the use of lexicase selection improves problem-...
Comments