Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solving
Not on the map. Why?
Abstract (arXiv)
Genetic Programming (GP) often uses large training sets and requires all individuals to be evaluated on all training cases during selection. Random down-sampled lexicase selection evaluates individuals on only a random subset of the training cases allowing for more individuals to be explored with the same amount of program executions. However, creating a down-sample randomly might exclude important cases from the current down-sample for a number of generations, while cases that measure the same behavior (synonymous cases) may be overused despite their redundancy. In this work, we introduce Informed Down-Sampled Lexicase Selection. This method leverages population statistics to build down-samples that contain more distinct and therefore informative training cases. Through an empirical investigation across two different GP systems (PushGP and Grammar-Guided GP), we find that informed down-sampling significantly outperforms random down-sampling on a set of contemporary program synthesis benchmark problems. Through an analysis of the created down-samples, we find that important training cases are included in the down-sample consistently across independent evolutionary runs and systems. We hypothesize that this improvement can be attributed to the ability of Informed Down-Sampled Lexicase Selection to maintain more specialist individuals over the course of evolution, while also benefiting from reduced per-evaluation costs.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Jan 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 1.
5 papers.
- 2025LLM-Meta-SR: In-Context Learning for Evolving Selection Operators in Symbolic Regressioncited by 6
- 2023Probabilistic Lexicase Selectioncited by 3
- 2023Particularitycited by 3
- 2024DALex: Lexicase-like Selection via Diverse Aggregationcited by 3
- 2024Generational Computation Reduction in Informal Counterexample-Driven Genetic Programmingcited by 0
- 2025LLM-Meta-SR: In-Context Learning for Evolving Selection Operators in Symbolic Regression24 May 2025
- 2024Generational Computation Reduction in Informal Counterexample-Driven Genetic Programming8 Aug 2024
- 2024DALex: Lexicase-like Selection via Diverse Aggregation23 Jan 2024
- 2023Particularity12 Jun 2023
- 2023Probabilistic Lexicase Selection19 May 2023