Li Ding
Lee Spector
ABSTRACT
Lexicase selection is a widely used parent selection algorithm in genetic programming, known for its success in various task domains such as program synthesis, symbolic regression, and machine learning. Due to its non-parametric and recursive nature, calculating the probability of each individual being selected by lexicase selection has been proven to be an NP-hard problem, which discourages deeper theoretical understanding and practical improvements to the algorithm. In this work, we introduce probabilistic lexicase selection (plexicase selection), a novel parent selection algorithm that efficiently approximates the probability distribution of lexicase selection. Our method not only demonstrates superior problem-solving capabilities as a semantic-aware selection method, but also benefits from having a probabilistic representation of the selection process for enhanced efficiency and flexibility. Experiments are conducted in two prevalent domains in genetic programming: program synthesis and symbolic regression, using standard benchmarks including PSB and SRBench. The empirical results show that plexicase selection achieves state-of-the-art problem-solving performance that is competitive to the lexicase selection, and significantly outperforms lexicase selection in computation efficiency.
Supplemental Material
Available for Download
pdf
p1073-ding-suppl.pdf (434.4 KB)
Supplemental material.
- Sneha Aenugu and Lee Spector. 2019. Lexicase selection in learning classifier systems. In Proceedings of the Genetic and Evolutionary Computation Conference. 356--364.Google Scholar
Digital Library
- James Edward Baker. 2014. Adaptive selection methods for genetic algorithms. In Proceedings of the first international conference on genetic algorithms and their applications. Psychology Press, 101--106.Google Scholar
- James E Baker et al. 1987. Reducing bias and inefficiency in the selection algorithm. In Proceedings of the second international conference on genetic algorithms, Vol. 206. 14--21.Google Scholar
- Ryan Boldi, Martin Briesch, Dominik Sobania, Alexander Lalejini, Thomas Helmuth, Franz Rothlauf, Charles Ofria, and Lee Spector. 2023. Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solving. arXiv preprint arXiv:2301.01488 (2023).Google Scholar
- Vinícius V De Melo, Danilo Vasconcellos Vargas, and Wolfgang Banzhaf. 2019. Batch tournament selection for genetic programming: the quality of lexicase, the speed of tournament. In Proceedings of the genetic and evolutionary computation conference. 994--1002.Google ScholarDigital Library
- Li Ding, Ryan Boldi, Thomas Helmuth, and Lee Spector. 2022. Going faster and hence further with lexicase selection. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 538--541.Google ScholarDigital Library
- Li Ding, Ryan Boldi, Thomas Helmuth, and Lee Spector. 2022. Lexicase selection at scale. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 2054--2062.Google ScholarDigital Library
- Li Ding and Lee Spector. 2021. Evolving neural selection with adaptive regularization. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 1717--1725.Google ScholarDigital Library
- Li Ding and Lee Spector. 2022. Evolutionary quantum architecture search for parametrized quantum circuits. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 2190--2195.Google ScholarDigital Library
- Li Ding and Lee Spector. 2022. Optimizing Neural Networks with Gradient Lexicase Selection. In International Conference on Learning Representations.Google Scholar
- Li Ding and Lee Spector. 2023. Multi-Objective Evolutionary Architecture Search for Parameterized Quantum Circuits. Entropy 25, 1 (2023), 93.Google ScholarCross Ref
- Emily Dolson. 2023. Calculating lexicase selection probabilities is NP-Hard. arXiv preprint arXiv:2301.06724 (2023).Google Scholar
- Austin J. Ferguson, Jose Guadalupe Hernandez, Daniel Junghans, Alexander Lalejini, Emily Dolson, and Charles Ofria. 2019. Characterizing the effects of random subsampling and dilution on Lexicase selection, In Genetic Programming Theory and Practice XVII, Wolfgang Banzhaf, Erik Goodman, Leigh Sheneman, Leonardo Trujillo, and Bill Worzel (Eds.). Genetic Programming Theory and Practice XVII.Google Scholar
- Jonathan E Fieldsend and Alberto Moraglio. 2015. Strength through diversity: Disaggregation and multi-objectivisation approaches for genetic programming. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. 1031--1038.Google ScholarDigital Library
- Stefan Forstenlechner, David Fagan, Miguel Nicolau, and Michael O'Neill. 2018. Extending program synthesis grammars for grammar-guided genetic programming. In Parallel Problem Solving from Nature-PPSN XV: 15th International Conference, Coimbra, Portugal, September 8--12, 2018, Proceedings, Part I 15. Springer, 197--208.Google Scholar
- Edgar Galvan-Lopez, Brendan Cody-Kenny, Leonardo Trujillo, and Ahmed Kattan. 2013. Using semantics in the selection mechanism in genetic programming: a simple method for promoting semantic diversity. In 2013 IEEE Congress on Evolutionary Computation. IEEE, 2972--2979.Google ScholarCross Ref
- David E Golberg. 1989. Genetic algorithms in search, optimization, and machine learning. Addion wesley 1989, 102 (1989), 36.Google ScholarDigital Library
- David E Goldberg and Kalyanmoy Deb. 1991. A comparative analysis of selection schemes used in genetic algorithms. In Foundations of genetic algorithms. Vol. 1. Elsevier, 69--93.Google Scholar
- Thomas Helmuth, Johannes Lengler, and William La Cava. 2022. Population Diversity Leads to Short Running Times of Lexicase Selection. In Parallel Problem Solving from Nature-PPSN XVII: 17th International Conference, PPSN 2022, Dortmund, Germany, September 10--14, 2022, Proceedings, Part II. Springer, 485--498.Google Scholar
- Thomas Helmuth, Nicholas Freitag McPhee, and Lee Spector. 2016. The impact of hyperselection on lexicase selection. In Proceedings of the Genetic and Evolutionary Computation Conference 2016. 717--724.Google Scholar
- Thomas Helmuth, Nicholas Freitag McPhee, and Lee Spector. 2016. Lexicase selection for program synthesis: a diversity analysis. In Genetic Programming Theory and Practice XIII. Springer, 151--167.Google Scholar
- Thomas Helmuth, Nicholas Freitag McPhee, and Lee Spector. 2018. Program synthesis using uniform mutation by addition and deletion. In Proceedings of the Genetic and Evolutionary Computation Conference. 1127--1134.Google ScholarDigital Library
- Thomas Helmuth, Edward Pantridge, and Lee Spector. 2019. Lexicase Selection of Specialists. In Proceedings of the Genetic and Evolutionary Computation Conference (Prague, Czech Republic) (GECCO '19). Association for Computing Machinery, New York, NY, USA, 1030--1038. Google ScholarDigital Library
- Thomas Helmuth, Edward Pantridge, and Lee Spector. 2020. On the Importance of Specialists for Lexicase Selection. Genetic Programming and Evolvable Machines 21, 3 (sep 2020), 349--373. Google ScholarDigital Library
- Thomas Helmuth and Lee Spector. 2015. General program synthesis benchmark suite. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. 1039--1046.Google ScholarDigital Library
- Thomas Helmuth and Lee Spector. 2020. Explaining and exploiting the advantages of down-sampled lexicase selection. In ALIFE 2020: The 2020 Conference on Artificial Life. MIT Press, 341--349.Google ScholarCross Ref
- Thomas Helmuth and Lee Spector. 2022. Problem-solving benefits of down-sampled lexicase selection. Artificial Life 27, 3--4 (2022), 183--203.Google ScholarCross Ref
- Thomas Helmuth, Lee Spector, and James Matheson. 2014. Solving uncompromising problems with lexicase selection. IEEE Transactions on Evolutionary Computation 19, 5 (2014), 630--643.Google ScholarDigital Library
- Jose Guadalupe Hernandez, Alexander Lalejini, Emily Dolson, and Charles Ofria. 2019. Random subsampling improves performance in lexicase selection. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 2028--2031.Google ScholarDigital Library
- Joost Huizinga and Jeff Clune. 2018. Evolving multimodal robot behavior via many stepping stones with the combinatorial multi-objective evolutionary algorithm. arXiv preprint arXiv:1807.03392 (2018).Google Scholar
- Krzysztof Krawiec and Paweł Liskowski. 2015. Automatic derivation of search objectives for test-based genetic programming. In European Conference on Genetic Programming. Springer, 53--65.Google ScholarCross Ref
- William La Cava, Thomas Helmuth, Lee Spector, and Jason H Moore. 2019. A probabilistic and multi-objective analysis of lexicase selection and ε-lexicase selection. Evolutionary Computation 27, 3 (2019), 377--402.Google ScholarDigital Library
- William La Cava and Jason Moore. 2018. Behavioral search drivers and the role of elitism in soft robotics. In ALIFE 2018: The 2018 Conference on Artificial Life. MIT Press, 206--213.Google ScholarCross Ref
- William La Cava and Jason H Moore. 2020. Genetic programming approaches to learning fair classifiers. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference. 967--975.Google ScholarDigital Library
- William La Cava and Jason H Moore. 2020. Learning feature spaces for regression with genetic programming. Genetic Programming and Evolvable Machines 21, 3 (2020), 433--467.Google ScholarDigital Library
- William La Cava, Patryk Orzechowski, Bogdan Burlacu, Fabrício Olivetti de França, Marco Virgolin, Ying Jin, Michael Kommenda, and Jason H Moore. 2021. Contemporary symbolic regression methods and their relative performance. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks, Vol. 1.Google Scholar
- William La Cava, Tilak Raj Singh, James Taggart, Srinivas Suri, and Jason H Moore. 2018. Learning concise representations for regression by evolving networks of trees. arXiv preprint arXiv:1807.00981 (2018).Google Scholar
- William La Cava, Lee Spector, and Kourosh Danai. 2016. Epsilon-lexicase selection for regression. In Proceedings of the Genetic and Evolutionary Computation Conference 2016. 741--748.Google ScholarDigital Library
- Adam Lipowski and Dorota Lipowska. 2012. Roulette-wheel selection via stochastic acceptance. Physica A: Statistical Mechanics and its Applications 391, 6 (2012), 2193--2196.Google Scholar
- Pawel Liskowski, Krzysztof Krawiec, Thomas Helmuth, and Lee Spector. 2015. Comparison of semantic-aware selection methods in genetic programming. In Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation. 1301--1307.Google ScholarDigital Library
- Alexander McFarlane Mood. 1950. Introduction to the Theory of Statistics. (1950).Google Scholar
- Jared M Moore and Adam Stanton. 2017. Lexicase selection outperforms previous strategies for incremental evolution of virtual creature controllers. In ECAL 2017, the Fourteenth European Conference on Artificial Life. MIT Press, 290--297.Google ScholarCross Ref
- Jared M Moore and Adam Stanton. 2018. Tiebreaks and Diversity: Isolating Effects in Lexicase Selection., 590--597 pages. Google ScholarCross Ref
- Edward Pantridge, Thomas Helmuth, and Lee Spector. 2022. Functional code building genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference. 1000--1008.Google ScholarDigital Library
- Edward Pantridge and Lee Spector. 2020. Code building genetic programming. In Proceedings of the 2020 Genetic and Evolutionary Computation Conference. 994--1002.Google ScholarDigital Library
- Karl Pearson. 1900. X. On the criterion that a given system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen from random sampling. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science 50, 302 (1900), 157--175.Google ScholarCross Ref
- Lee Spector. 2012. 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. 401--408.Google ScholarDigital Library
- Sarah Anne Troise and Thomas Helmuth. 2018. Lexicase selection with weighted shuffle. In Genetic Programming Theory and Practice XV. Springer, 89--104.Google Scholar
Index Terms
- Probabilistic Lexicase Selection
Recommendations
Lexicase selection at scale
GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference CompanionLexicase selection is a semantic-aware parent selection method, which assesses individual test cases in a randomly-shuffled data stream. It has demonstrated success in multiple research areas including genetic programming, genetic algorithms, and more ...
Random subsampling improves performance in lexicase selection
GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference CompanionLexicase selection has been proven highly successful for finding effective solutions to problems in genetic programming, especially for test-based problems where there are many distinct test cases that must all be passed. However, lexicase (as with most ...
The Impact of Hyperselection on Lexicase Selection
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Lexicase 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 ...
Comments