Improving Lexicase Selection with Informed Down-Sampling
Open Access
- 14 July 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 25-26
Abstract
This short paper presents the main findings of our work titled Informed Down-Sampled Lexicase Selection: Identifying Productive Training Cases for Efficient Problem Solving, which was recently published in the Evolutionary Computation Journal. In this work, we introduce informed down-sampled lexicase selection to dynamically build diverse subsets of training cases during evolution using population statistics. We evaluate our method on a set of program synthesis problems in two genetic programming systems and find that informed down-sampling improves performance in both systems compared to random down-sampling when using lexicase selection. Additionally, we investigate the constructed down-samples and find that informed down-sampling can identify important training cases and does so across different evolutionary runs and systems.Keywords
Funding Information
- National Science Foundation (2117377)
This publication has 11 references indexed in Scilit:
- Informed Down-Sampled Lexicase Selection: Identifying Productive Training Cases for Efficient Problem SolvingEvolutionary Computation, 2024
- The Problem Solving Benefits of Down-sampling Vary by Selection Scheme2023
- Down-Sampled Epsilon-Lexicase Selection for Real-World Symbolic Regression Problems2023
- Random subsampling improves performance in lexicase selection2019
- Epsilon-Lexicase Selection for Regression2016
- Grammar Design for Derivation Tree Based Genetic Programming Systems2016
- General Program Synthesis Benchmark Suite2015
- Solving Uncompromising Problems With Lexicase SelectionIEEE Transactions on Evolutionary Computation, 2014
- Genetic Programming and Autoconstructive Evolution with the Push Programming LanguageGenetic Programming and Evolvable Machines, 2002
- A Best Possible Heuristic for the k-Center ProblemMathematics of Operations Research, 1985