Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solving
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909116191997952 |
|---|---|
| author | Boldi, Ryan Briesch, Martin Sobania, Dominik Lalejini, Alexander Helmuth, Thomas Rothlauf, Franz Ofria, Charles Spector, Lee |
| author_facet | Boldi, Ryan Briesch, Martin Sobania, Dominik Lalejini, Alexander Helmuth, Thomas Rothlauf, Franz Ofria, Charles Spector, Lee |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2301_01488 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solving Boldi, Ryan Briesch, Martin Sobania, Dominik Lalejini, Alexander Helmuth, Thomas Rothlauf, Franz Ofria, Charles Spector, Lee Neural and Evolutionary Computing 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. |
| title | Informed Down-Sampled Lexicase Selection: Identifying productive training cases for efficient problem solving |
| topic | Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2301.01488 |