%0 Book Section %1 Kotanchek:2006:GPTP %A Kotanchek, Mark %A Smits, Guido %A Vladislavleva, Ekaterina %B Genetic Programming Theory and Practice IV %C Ann Arbor %D 2006 %E Riolo, Rick L. %E Soule, Terence %E Worzel, Bill %I Springer %K algorithms, genetic programming %P 167--186 %T Pursuing the Pareto Paradigm Tournaments, Algorithm Variations & Ordinal Optimization %V 5 %X The ParetoGP algorithm, which adopts a multi-objective optimisation approach to balancing expression complexity and accuracy, has proven to have significant impact on symbolic regression of industrial data due to its improvement in speed and quality of model development as well as user model selection. In this chapter, we explore a range of topics related to exploiting the Pareto paradigm. First we describe and explore the strengths and weaknesses of the ClassicGP and ParetoGP variants for symbolic regression as well as touch on related algorithms. Next, we show a derivation for the selection intensity of tournament selection with multiple winners (albeit, in a single-objective case). We then extend classical tournament and elite selection strategies into a multi-objective framework which allows classical GP schemes to be readily Pareto-aware. Finally, we introduce the latest extension of the Pareto paradigm which is the melding with ordinal optimization. It appears that ordinal optimisation will provide a theoretical foundation to guide algorithm design. Application of these insights has already produced at least a four-fold improvement in the performance for a suite of test problems. %& 12 %@ 0-387-33375-4

@incollection{Kotanchek:2006:GPTP, abstract = {The ParetoGP algorithm, which adopts a multi-objective optimisation approach to balancing expression complexity and accuracy, has proven to have significant impact on symbolic regression of industrial data due to its improvement in speed and quality of model development as well as user model selection. In this chapter, we explore a range of topics related to exploiting the Pareto paradigm. First we describe and explore the strengths and weaknesses of the ClassicGP and ParetoGP variants for symbolic regression as well as touch on related algorithms. Next, we show a derivation for the selection intensity of tournament selection with multiple winners (albeit, in a single-objective case). We then extend classical tournament and elite selection strategies into a multi-objective framework which allows classical GP schemes to be readily Pareto-aware. Finally, we introduce the latest extension of the Pareto paradigm which is the melding with ordinal optimization. It appears that ordinal optimisation will provide a theoretical foundation to guide algorithm design. Application of these insights has already produced at least a four-fold improvement in the performance for a suite of test problems.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Ann Arbor}, author = {Kotanchek, Mark and Smits, Guido and Vladislavleva, Ekaterina}, biburl = {https://www.bibsonomy.org/bibtex/201f45b7f40f16d48a4b7397c07ee6b95/brazovayeye}, booktitle = {Genetic Programming Theory and Practice {IV}}, chapter = 12, editor = {Riolo, Rick L. and Soule, Terence and Worzel, Bill}, interhash = {699b412e6bd28b753633c59c8b8c900c}, intrahash = {01f45b7f40f16d48a4b7397c07ee6b95}, isbn = {0-387-33375-4}, keywords = {algorithms, genetic programming}, month = {11-13 May}, notes = {part of \cite{Riolo:2006:GPTP} Published Jan 2007 after the workshop}, pages = {167--186}, publisher = {Springer}, series = {Genetic and Evolutionary Computation}, timestamp = {2008-06-19T17:43:42.000+0200}, title = {Pursuing the Pareto Paradigm Tournaments, Algorithm Variations \& Ordinal Optimization}, volume = 5, year = 2006 }