IEEE Transactions on Evolutionary Computation 19, 5 (Oct. Solving Uncompromising Problems with Lexicase Selection. Thomas Helmuth, Lee Spector, and James Matheson.In GECCO '15: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. General Program Synthesis Benchmark Suite. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms. In Genetic Programming Theory and Practice XVII, Wolfgang Banzhaf, Erik Goodman, Leigh Sheneman, Leonardo Trujillo, and Bill Worzel (Eds.). Characterizing the effects of random subsampling on Lexicase selection. Austin J Ferguson, Jose Guadalupe Hernandez, Daniel Junghans, Emily Dolson, and Charles Ofria.We find that a few methods, all variants of lexicase selection, rise to the top and demand further study, both within the field of program synthesis and in other domains. We specifically focus on the domain of general program synthesis, where solution programs must make use of multiple data types and control flow structures, and use an existing benchmark suite within the domain. This paper aims to benchmark many recent and common parent selection methods by comparing them within a single system and set of benchmark problems. Many parent selection methods have been proposed in the literature, with aims of improving problem-solving performance or other characteristics of the GP system. This process directly impacts the search performance by determining on which areas of the search space genetic programming focuses its attention and how it balances exploration and exploitation. In genetic programming, the parent selection method determines which individuals in the population are selected to be parents for the next generation, and how many children they create.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |