Batch Tournament Selection for Genetic Programming

Lexicase selection achieves very good solution quality by introducing ordered test cases. However, the computational complexity of lexicase selection can prohibit its use in many applications. In this paper, we introduce Batch Tournament Selection (BTS), a hybrid of tournament and lexicase selection which is approximately one order of magnitude faster than lexicase selection while achieving a competitive quality of solutions. Tests on a number of regression datasets show that BTS compares well with lexicase selection in terms of mean absolute error while having a speed-up of up to 25 times. Surprisingly, BTS and lexicase selection have almost no difference in both diversity and performance. This reveals that batches and ordered test cases are completely different mechanisms which share the same general principle fostering the specialization of individuals. This work introduces an efficient algorithm that sheds light onto the main principles behind the success of lexicase, potentially opening up a new range of possibilities for algorithms to come.

[1]  Krzysztof Krawiec,et al.  Automatic Derivation of Search Objectives for Test-Based Genetic Programming , 2015, EuroGP.

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

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

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

[5]  Peter Nordin,et al.  Evolution of a world model for a miniature robot using genetic programming , 1998, Robotics Auton. Syst..

[6]  David E. Goldberg,et al.  Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..

[7]  Gisele L. Pappa,et al.  A Dispersion Operator for Geometric Semantic Genetic Programming , 2016, GECCO.

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

[9]  Junichi Murata,et al.  General Subpopulation Framework and Taming the Conflict Inside Populations , 2015, Evolutionary Computation.

[10]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[11]  Peter Nordin,et al.  An On-Line Method to Evolve Behavior and to Control a Miniature Robot in Real Time with Genetic Programming , 1996, Adapt. Behav..

[12]  Junichi Murata,et al.  Self organizing classifiers and niched fitness , 2013, GECCO '13.

[13]  Mihai Oltean,et al.  A Comparison of Several Linear Genetic Programming Techniques , 2003, Complex Syst..

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

[15]  Yaochu Jin,et al.  Surrogate-assisted evolutionary computation: Recent advances and future challenges , 2011, Swarm Evol. Comput..