Abstract
Lexicase selection is a selection method that was developed for parent selection in genetic programming. In this chapter, we present a study of lexicase selection in a non-genetic-programming context, conducted to investigate the broader applicability of the technique. Specifically, we present a framework for solving Boolean constraint satisfaction problems using a traditional genetic algorithm, with linear genomes of fixed length. We present results of experiments in this framework using three parent selection algorithms: lexicase selection, tournament selection (with several tournament sizes), and fitness-proportionate selection. The results show that when lexicase selection is used, more solutions are found, fewer generations are required to find those solutions, and more diverse populations are maintained. We discuss the implications of these results for the utility of lexicase selection more generally.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
It is also possible to limit the initial pools in various ways. When the initial pool contains the entire population, which is the best-studied setting, we refer to the algorithm more specifically as “global pool” lexicase selection.
References
Craenen, B.G.W., Eiben, A.E., van Hemert, J.I.: Comparing evolutionary algorithms on binary constraint satisfaction problems. IEEE Transactions on Evolutionary Computation 7(5), 424–444 (2003). https://doi.org/10.1109/TEVC.2003.816584
Helmuth, T., McPhee, N.F., Spector, L.: Effects of Lexicase and Tournament Selection on Diversity Recovery and Maintenance. In: Companion Proceedings of the 2016 Conference on Genetic and Evolutionary Computation, pp. 983–990. ACM (2016). http://dl.acm.org/citation.cfm?id=2931657
Helmuth, T., McPhee, N.F., Spector, L.: The impact of hyperselection on lexicase selection. In: Proceedings of the 2016 Conference on Genetic and Evolutionary Computation, pp. 717–724. ACM (2016). http://dl.acm.org/citation.cfm?id=2908851
Helmuth, T., McPhee, N.F., Spector, L.: Lexicase selection for program synthesis: a diversity analysis. In: Genetic Programming Theory and Practice XIII, pp. 151–167. Springer (2016)
Helmuth, T., Spector, L., Matheson, J.: Solving Uncompromising Problems with Lexicase Selection. IEEE Transactions on Evolutionary Computation 19, 630–643 (2014). https://doi.org/10.1109/TEVC.2014.2362729
Järvisalo, M., Berre, D.L., Roussel, O., Simon, L.: The international sat solver competitions. AI Magazine 33, 89–92 (2012)
La Cava, W., Helmuth, T., Spector, L., Moore, J.H.: A probabilistic and multi-objective analysis of lexicase selection and -lexicase selection. Evolutionary Computation (2018). https://doi.org/10.1162/evco_a_00224. In press.
La Cava, W., Moore, J.: A general feature engineering wrapper for machine learning using epsilon-lexicase survival. In: M. Castelli, J. McDermott, L. Sekanina (eds.) EuroGP 2017: Proceedings of the 20th European Conference on Genetic Programming, LNCS, vol. 10196, pp. 80–95. Springer Verlag, Amsterdam (2017). https://doi.org/10.1007/978-3-319-55696-3_6
La Cava, W., Spector, L., Danai, K.: Epsilon-Lexicase Selection for Regression. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, GECCO ’16, pp. 741–748. ACM, New York, NY, USA (2016). http://doi.acm.org/10.1145/2908812.2908898
McPhee, N.F., Casale, M.M., Finzel, M., Helmuth, T., Spector, L.: Visualizing Genetic Programming Ancestries. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion, pp. 1419–1426. ACM (2016). http://dl.acm.org/citation.cfm?id=2931741
Spector, L.: Assessment of problem modality by differential performance of lexicase selection in genetic programming: a preliminary report. In: Proceedings of the 14th annual conference companion on Genetic and evolutionary computation, pp. 401–408. ACM (2012)
Spector, L., La Cava, W., Shanabrook, S., Helmuth, T., Pantridge, E.: Relaxations of lexicase parent selection. In: W. Banzhaf, R.S. Olson, W. Tozier, R. Riolo (eds.) Genetic Programming Theory and Practice XV, pp. 105–120. Springer International Publishing, Cham (2018)
Acknowledgements
We thank other members of the Hampshire College Institute for Computational Intelligence, along with other participants in the Genetic Programming Theory and Practice workshop, for helpful feedback and stimulating discussions.
This material is based upon work supported by the National Science Foundation under Grant No. 1617087. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the National Science Foundation.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Metevier, B., Saini, A.K., Spector, L. (2019). Lexicase Selection Beyond Genetic Programming. In: Banzhaf, W., Spector, L., Sheneman, L. (eds) Genetic Programming Theory and Practice XVI. Genetic and Evolutionary Computation. Springer, Cham. https://doi.org/10.1007/978-3-030-04735-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-030-04735-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04734-4
Online ISBN: 978-3-030-04735-1
eBook Packages: Computer ScienceComputer Science (R0)