Assessment of problem modality by differential performance of lexicase selection in genetic programming: a preliminary report

@inproceedings{Spector2012AssessmentOP,
  title={Assessment of problem modality by differential performance of lexicase selection in genetic programming: a preliminary report},
  author={Lee Spector},
  booktitle={GECCO '12},
  year={2012}
}
  • L. Spector
  • Published in GECCO '12 7 July 2012
  • Mathematics, Computer Science
Many potential target problems for genetic programming are modal in the sense that qualitatively different modes of response are required for inputs from different regions of the problem's domain. This paper presents a new approach to solving modal problems with genetic programming, using a simple and novel parent selection method called lexicase selection. It then shows how the differential performance of genetic programming with and without lexicase selection can be used to provide a measure… Expand
A behavior-based analysis of modal problems
TLDR
Modality, in this sense, is better understood by analyzing program performance in behavioral space, and the experimental evidence presented here suggests that behavior-based search could allow a GP to find programs with disjoint behavioral structures, that can satisfy the requirements of each mode of operation of a modal problem. Expand
Solving Uncompromising Problems With Lexicase Selection
TLDR
Evidence is provided that lexicase selection maintains higher levels of population diversity than other selection methods, which may partially explain its utility as a parent selection algorithm in the context of uncompromising problems. Expand
Comparison of Semantic-aware Selection Methods in Genetic Programming
TLDR
This study investigates the performance of several semantic- aware selection methods for genetic programming (GP) that do not rely on complete GP semantics, but on binary outcome vectors that only state whether a given test has been passed by a program or not. Expand
Learning feature spaces for regression with genetic programming
TLDR
It is found that a semantic crossover operator based on stagewise regression leads to significant improvements on a set of regression problems, and the inclusion of semantic crossover produces state-of-the-art results in a large benchmark study of open-source regression problems. Expand
Specialization and elitism in lexicase and tournament selection
TLDR
The results show that lexicase selection selects parents with poor total error far more frequently than tournament selection, even near the ends of successful runs, suggesting that such selections are integral to the improved problem-solving performance of lexiase selection. Expand
A Probabilistic and Multi-Objective Analysis of Lexicase Selection and ε-Lexicase Selection
TLDR
An analytical formula is derived that gives the expected probabilities of selection under lexicase selection, given a population and its behavior, and it is shown that ε-lexicase outperforms several diversity–maintenance strategies on a number of real-world and synthetic regression problems. Expand
Problem-solving benefits of down-sampled lexicase selection
TLDR
Down-sampled lexicase selection’s main benefit stems from the fact that it allows the evolutionary process to examine more individuals within the population, showing that its benefits hold up to increased scrutiny. Expand
The Impact of Hyperselection on Lexicase Selection
TLDR
It is concluded that the power of lexicase selection stems from the collection of individuals that it selects, not from the unusual frequencies with which it sometimes selects them. Expand
Lexicase selection promotes effective search and behavioural diversity of solutions in Linear Genetic Programming
TLDR
It is concluded that lexicase selection drives the search towards good solutions more effectively than tournament selection, and that this effect correlates with improved behavioural diversity in most cases. Expand
- lexicase selection for regression
Lexicase selection is a parent selection method that considers test cases separately, rather than in aggregate, when performing parent selection. It performs well in discrete error spaces but not onExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Difficulty of Unimodal and Multimodal Landscapes in Genetic Programming
TLDR
Results are in agreement with empirical observations, thus confirming that fitness distance correlation can be considered a reasonable index of difficulty for genetic programming, at least for the set of problems studied here. Expand
Genetic Programming and Data Structures: Genetic Programming + Data Structures = Automatic Programming!
TLDR
This book should be of direct interest to computer scientists doing research on genetic programming, genetic algorithms, data structures, and artificial intelligence, and to practitioners working in all of these areas and to those interested in automatic programming. Expand
Genetic programming - on the programming of computers by means of natural selection
  • J. Koza
  • Computer Science
  • Complex adaptive systems
  • 1993
TLDR
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming. Expand
A Field Guide to Genetic Programming
TLDR
A unique overview of this exciting technique is written by three of the most active scientists in GP, which starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination until high-fitness solutions emerge. Expand
Priorities in multi-objective optimization for genetic programming
A new technique for multi-objective optimization is presented that allows to include priorities. But in contrast to previous techniques they can be included very easily and do not require much userExpand
Genetic Programming with Historically Assessed Hardness
We present a variation of the genetic programming algorithm, called Historically Assessed Hardness (HAH), in which the fitness rewards for particular test cases are scaled in proportion to theirExpand
Pursuing the Pareto Paradigm: Tournaments, Algorithm Variations and Ordinal Optimization
The ParetoGP algorithm which adopts a multi-objective optimization approach to balancing expression complexity and accuracy has proven to have significant impact on symbolic regression of industrialExpand
Alternative Bloat Control Methods
TLDR
Three new methods for bloat control are introduced: Biased Multi-Objective Parsimony Pressure (BMOPP), the Waiting Room, and Death by Size, which find parameter settings for BMOPP and the waiting room which are effective across all tested problem domains. Expand
Ensemble Classifiers: AdaBoost and Orthogonal Evolution of Teams
TLDR
OET is compared to Orthogonal Evolution of Teams (OET), an approach for generating ensembles that allows for a much wider range of problems and cooperation mechanisms and is slightly more likely to produce better results than AdaBoost. Expand
Trivial Geography in Genetic Programming
Geographical distribution is widely held to be a major determinant of evolutionary dynamics. Correspondingly, genetic programming theorists and practitioners have long developed, used, and studiedExpand
...
1
2
...