Relaxations of Lexicase Parent Selection

Created by W.Langdon from gp-bibliography.bib Revision:1.7615

@InProceedings{Spector:2017:GPTP,

• author = "Lee Spector and William {La Cava} and Saul Shanabrook and Thomas Helmuth and Edward Pantridge",
• title = "Relaxations of Lexicase Parent Selection",
• booktitle = "Genetic Programming Theory and Practice XV",
• editor = "Wolfgang Banzhaf and Randal S. Olson and William Tozier and Rick Riolo",
• year = "2017",
• series = "Genetic and Evolutionary Computation",
• pages = "105--120",
• address = "University of Michigan in Ann Arbor, USA",
• month = may # " 18--20",
• organisation = "the Center for the Study of Complex Systems",
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-319-90511-2",
• URL = "https://link.springer.com/chapter/10.1007/978-3-319-90512-9_7",
• DOI = "doi:10.1007/978-3-319-90512-9_7",
• abstract = "In a genetic programming system, the parent selection algorithm determines which programs in the evolving population will be used as the material out of which new programs will be constructed. The lexicase parent selection algorithm chooses a parent by considering all test cases, individually, one at a time, in a random order, to reduce the pool of possible parent programs. Lexicase selection is ordinarily strict, in that a program can only be selected if it has the best error in the entire population on the first test case considered, and the best error relative to all other programs that remain in the pool each time it is reduced. This strictness may exclude high-quality candidates from consideration for parenthood, and hence from exploration by the evolutionary process. In this chapter we describe and present results of four variants of lexicase selection that relax these strict constraints: epsilon lexicase selection, random threshold lexicase selection, MADCAP epsilon lexicase selection, and truncated lexicase selection. We present the results of experiments with genetic programming systems using these and other parent selection algorithms on symbolic regression and software synthesis problems. We also briefly discuss the relations between lexicase selection and work on many-objective optimization, and the implications of these considerations for future work on parent selection in genetic programming.",
• notes = "GPTP 2017, Part of \cite{Banzhaf:2017:GPTP} published after the workshop in 2018",

}

Genetic Programming entries for Lee Spector William La Cava Saul Shanabrook Thomas Helmuth Edward R Pantridge

Citations