abstract = "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 of problem modality, and it
argues that defining such a measure in this way is not
as methodologically problematic as it may initially
appear. The modality measure is illustrated through the
analysis of genetic programming runs on a simple modal
symbolic regression problem. This is a preliminary
report that is intended in part to stimulate discussion
on the significance of modal problems, methods for
solving them, and methods for measuring the modality of
problems. Although the core concepts in this paper are
presented in the context of genetic programming, they
are also relevant to applications of other forms of
evolutionary computation to modal problems.",
notes = "p403 'allowing the high-performing individual [on any
test case] to contribute to the following generation,
regardless of [its] performance on other cases.' p405
'with population size 10000 the overall cost of
producing offspring using lexicase selection can exceed
that of using ordinary tournaments by between one and
two orders of magnitude'. (why?) Section 5: integer
symbolic regresions with one, two or three 'modes'.
Clojure lexicase.clj
https://gist.github.com/lspector/2320883
Also known as \cite{2330846} Distributed at
GECCO-2012.