Lexicase selection of specialists

Lexicase parent selection filters the population by considering one random training case at a time, eliminating any individuals with errors for the current case that are worse than the best error in the selection pool, until a single individual remains. This process often stops before considering all training cases, meaning that it will ignore the error values on any cases that were not yet considered. Lexicase selection can therefore select specialist individuals that have poor errors on some training cases, if they have great errors on others and those errors come near the start of the random list of cases used for the parent selection event in question. We hypothesize here that selecting these specialists, which may have poor total error, plays an important role in lexicase selection's observed performance advantages over error-aggregating parent selection methods such as tournament selection, which select specialists much less frequently. We conduct experiments examining this hypothesis, and find that lexicase selection's performance and diversity maintenance degrade when we deprive it of the ability of selecting specialists. These findings help explain the improved performance of lexicase selection compared to tournament selection, and suggest that specialists help drive evolution under lexicase selection toward global solutions.

[1]  Lee Spector,et al.  Specialization and elitism in lexicase and tournament selection , 2018, GECCO.

[2]  Lee Spector,et al.  Effects of Lexicase and Tournament Selection on Diversity Recovery and Maintenance , 2016, GECCO.

[3]  Lee Spector,et al.  Genetic Programming and Autoconstructive Evolution with the Push Programming Language , 2002, Genetic Programming and Evolvable Machines.

[4]  Lee Spector,et al.  Lexicase Selection Beyond Genetic Programming , 2018, GPTP.

[5]  Maarten Keijzer,et al.  The Push3 execution stack and the evolution of control , 2005, GECCO '05.

[6]  Lee Spector,et al.  Improving generalization of evolved programs through automatic simplification , 2017, GECCO.

[7]  Thomas Helmuth,et al.  General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexicographic Orderings of Test Cases , 2015 .

[8]  Lee Spector,et al.  Lexicase Selection for Program Synthesis: A Diversity Analysis , 2016 .

[9]  Lee Spector,et al.  Evolving a digital multiplier with the pushgp genetic programming system , 2013, GECCO.

[10]  Lee Spector,et al.  Relaxations of Lexicase Parent Selection , 2017, GPTP.

[11]  Lothar Thiele,et al.  A Mathematical Analysis of Tournament Selection , 1995, ICGA.

[12]  Jared M. Moore,et al.  Lexicase selection outperforms previous strategies for incremental evolution of virtual creature controllers , 2017, ECAL.

[13]  Lee Spector,et al.  Assessment of problem modality by differential performance of lexicase selection in genetic programming: a preliminary report , 2012, GECCO '12.

[14]  Lee Spector,et al.  The Impact of Hyperselection on Lexicase Selection , 2016, GECCO.

[15]  David Fagan,et al.  Towards Understanding and Refining the General Program Synthesis Benchmark Suite with Genetic Programming , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[16]  Lee Spector,et al.  PyshGP: PushGP in Python , 2017, GECCO.

[17]  Thomas Bäck,et al.  Selective Pressure in Evolutionary Algorithms: A Characterization of Selection Mechanisms , 1994, International Conference on Evolutionary Computation.

[18]  Lee Spector,et al.  Using algorithm configuration tools to optimize genetic programming parameters: a case study , 2017, GECCO.

[19]  Christian General Chair-Alba Enrique Blum,et al.  Proceedings of the 15th annual conference companion on Genetic and evolutionary computation , 2013, Annual Conference on Genetic and Evolutionary Computation.

[20]  Lee Spector,et al.  Solving Uncompromising Problems With Lexicase Selection , 2015, IEEE Transactions on Evolutionary Computation.

[21]  Lee Spector,et al.  Epsilon-Lexicase Selection for Regression , 2016, GECCO.

[22]  David Fagan,et al.  Towards effective semantic operators for program synthesis in genetic programming , 2018, GECCO.

[23]  David Jackson,et al.  Promoting Phenotypic Diversity in Genetic Programming , 2010, PPSN.

[24]  David Fagan,et al.  A Grammar Design Pattern for Arbitrary Program Synthesis Problems in Genetic Programming , 2017, EuroGP.

[25]  David Fagan,et al.  Extending Program Synthesis Grammars for Grammar-Guided Genetic Programming , 2018, PPSN.

[26]  Christopher D. Rosin,et al.  Stepping Stones to Inductive Synthesis of Low-Level Looping Programs , 2018, AAAI.

[27]  Krzysztof Krawiec,et al.  Comparison of Semantic-aware Selection Methods in Genetic Programming , 2015, GECCO.

[28]  Lee Spector,et al.  General Program Synthesis Benchmark Suite , 2015, GECCO.

[29]  Jason H. Moore,et al.  A Probabilistic and Multi-Objective Analysis of Lexicase Selection and ε-Lexicase Selection , 2019, Evolutionary Computation.

[30]  Jason H. Moore,et al.  A probabilistic and multi-objective analysis of lexicase selection and epsilon-lexicase selection. , 2017 .