Batch Tournament Selection for Genetic Programming: The quality of lexicase, the speed of Tournament

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

@Misc{melo2019batch,

• author = "Vinicius V. Melo and Danilo Vasconcellos Vargas and Wolfgang Banzhaf",
• title = "Batch Tournament Selection for Genetic Programming: The quality of lexicase, the speed of Tournament",
• howpublished = "arXiv",
• year = "2019",
• month = "18 " # apr,
• note = "1904.08658",
• keywords = "genetic algorithms, genetic programming, Selection algorithm, Symbolic Regression",
• eprint = "1904.08658",
• primaryclass = "cs.NE",
• URL = "https://arxiv.org/abs/1904.08658",
• size = "9 pages",
• abstract = "Lexicase selection achieves very good solution quality by introducing ordered test cases. However, the computational complexity of lexicase selection can prohibit its use in many applications. we introduce Batch Tournament Selection (BTS), a hybrid of tournament and lexicase selection which is approximately one order of magnitude faster than lexicase selection while achieving a competitive quality of solutions. Tests on a number of regression datasets show that BTS compares well with lexicase selection in terms of mean absolute error while having a speed-up of up to 25 times. Surprisingly, BTS and lexicase selection have almost no difference in both diversity and performance. This reveals that batches and ordered test cases are completely different mechanisms which share the same general principle fostering the specialization of individuals. This work introduces an efficient algorithm that sheds light onto the main principles behind the success of lexicase, potentially opening up a new range of possibilities for algorithms to come.",
• notes = "See \cite{deMelo:2019:GECCO} From: Danilo Vasconcellos Vargas. Also known as \cite{DBLP:journals/corr/abs-1904-08658}",

}

Genetic Programming entries for Vinicius Veloso de Melo Danilo Vasconcellos Vargas Wolfgang Banzhaf

Citations