{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/destructiveness-of-lexicographic-parsimony","title":"Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming","arxiv_id":"1805.10169","date":"2018-05-25","proceeding":null,"authors":["Timo Kötzing","J. A. Gregor Lagodzinski","Johannes Lengler","Anna Melnichenko"],"abstract":"For theoretical analyses there are two specifics distinguishing GP from many\nother areas of evolutionary computation. First, the variable size\nrepresentations, in particular yielding a possible bloat (i.e. the growth of\nindividuals with redundant parts). Second, the role and realization of\ncrossover, which is particularly central in GP due to the tree-based\nrepresentation. Whereas some theoretical work on GP has studied the effects of\nbloat, crossover had a surprisingly little share in this work. We analyze a\nsimple crossover operator in combination with local search, where a preference\nfor small solutions minimizes bloat (lexicographic parsimony pressure); the\nresulting algorithm is denoted Concatenation Crossover GP. For this purpose\nthree variants of the well-studied MAJORITY test function with large plateaus\nare considered. We show that the Concatenation Crossover GP can efficiently\noptimize these test functions, while local search cannot be efficient for all\nthree variants independent of employing bloat control.","url_abs":"http://arxiv.org/abs/1805.10169v1","url_pdf":"http://arxiv.org/pdf/1805.10169v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"destructiveness-of-lexicographic-parsimony","repo_url":"https://github.com/melnan/1-1-GP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"destructiveness-of-lexicographic-parsimony","repo_url":"https://github.com/melnan/1_1_GP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}