- author = "Ryan Boldi and Ashley Bao and Martin Briesch and Thomas Helmuth and Dominik Sobania and Lee Spector and Alexander Lalejini",
- title = "The Problem Solving Benefits of {Down-Sampling} Vary by Selection Scheme",
- booktitle = "Proceedings of the 2023 Genetic and Evolutionary Computation Conference",
- year = "2023",
- editor = "Sara Silva and Luis Paquete and Leonardo Vanneschi and Nuno Lourenco and Ales Zamuda and Ahmed Kheiri and Arnaud Liefooghe and Bing Xue and Ying Bi and Nelishia Pillay and Irene Moser and Arthur Guijt and Jessica Catarino and Pablo Garcia-Sanchez and Leonardo Trujillo and Carla Silva and Nadarajen Veerapen",
- pages = "527--530",
- address = "Lisbon, Portugal",
- series = "GECCO '23",
- month = "15-19 " # jul,
- organisation = "SIGEVO",
- publisher = "Association for Computing Machinery",
- publisher_address = "New York, NY, USA",
- keywords = "genetic algorithms, genetic programming, program synthesis, down-sampling, selection, regression: Poster",
- isbn13 = "9798400701191",
-
DOI = "
doi:10.1145/3583133.3590713",
- size = "4 pages",
- abstract = "Genetic programming systems often use large training sets to evaluate candidate solutions, which can be computationally expensive. Down-sampling training sets has long been used to decrease the computational cost of evaluation in a wide range of application domains. Indeed, recent studies have shown that both random and informed down-sampling can substantially improve problem-solving success for GP systems that use lexicase parent selection. We use the PushGP framework to experimentally test whether these down-sampling techniques can also improve problem-solving success in the context of two other commonly used selection methods, fitness-proportionate and tournament selection, across eight GP problems (four program synthesis and four symbolic regression). We verified that down-sampling can benefit the problem-solving success of both fitness-proportionate and tournament selection. However, the number of problems wherein down-sampling improved problem-solving success varied by selection scheme, suggesting that the impact of down-sampling depends both on the problem and choice of selection scheme. Surprisingly, we found that down-sampling was most consistently beneficial when combined with lexicase selection as compared to tournament and fitness-proportionate selection. Overall, our results suggest that down-sampling should be considered more often when solving test-based GP problems.",
-
notes = "See \cite{Boldi:2024:ALife}
GECCO-2023 A Recombination of the 32nd International Conference on Genetic Algorithms (ICGA) and the 28th Annual Genetic Programming Conference (GP)",
