Compositional Genetic Programming for Symbolic Regression

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

@InProceedings{krawiec:2022:GECCOcomp,

• author = "Krzysztof Krawiec and Dominik Kossinski",
• title = "Compositional Genetic Programming for Symbolic Regression",
• booktitle = "Proceedings of the 2022 Genetic and Evolutionary Computation Conference Companion",
• year = "2022",
• editor = "Heike Trautmann and Carola Doerr and Alberto Moraglio and Thomas Bartz-Beielstein and Bogdan Filipic and Marcus Gallagher and Yew-Soon Ong and Abhishek Gupta and Anna V Kononova and Hao Wang and Michael Emmerich and Peter A. N. Bosman and Daniela Zaharie and Fabio Caraffini and Johann Dreo and Anne Auger and Konstantin Dietric and Paul Dufosse and Tobias Glasmachers and Nikolaus Hansen and Olaf Mersmann and Petr Posik and Tea Tusar and Dimo Brockhoff and Tome Eftimov and Pascal Kerschke and Boris Naujoks and Mike Preuss and Vanessa Volz and Bilel Derbel and Ke Li and Xiaodong Li and Saul Zapotecas and Qingfu Zhang and Mark Coletti and Catherine (Katie) Schuman and Eric ``Siggy'' Scott and Robert Patton and Paul Wiegand and Jeffrey K. Bassett and Chathika Gunaratne and Tinkle Chugh and Richard Allmendinger and Jussi Hakanen and Daniel Tauritz and John Woodward and Manuel Lopez-Ibanez and John McCall and Jaume Bacardit and Alexander Brownlee and Stefano Cagnoni and Giovanni Iacca and David Walker and Jamal Toutouh and UnaMay O'Reilly and Penousal Machado and Joao Correia and Sergio Nesmachnow and Josu Ceberio and Rafael Villanueva and Ignacio Hidalgo and Francisco {Fernandez de Vega} and Giuseppe Paolo and Alex Coninx and Antoine Cully and Adam Gaier and Stefan Wagner and Michael Affenzeller and Bobby R. Bruce and Vesna Nowack and Aymeric Blot and Emily Winter and William B. Langdon and Justyna Petke and Silvino {Fernandez Alzueta} and Pablo {Valledor Pellicer} and Thomas Stuetzle and David Paetzel and Alexander Wagner and Michael Heider and Nadarajen Veerapen and Katherine Malan and Arnaud Liefooghe and Sebastien Verel and Gabriela Ochoa and Mohammad Nabi Omidvar and Yuan Sun and Ernesto Tarantino and De Falco Ivanoe and Antonio {Della Cioppa} and Scafuri Umberto and John Rieffel and Jean-Baptiste Mouret and Stephane Doncieux and Stefanos Nikolaidis and Julian Togelius and Matthew C. Fontaine and Serban Georgescu and Francisco Chicano and Darrell Whitley and Oleksandr Kyriienko and Denny Dahl and Ofer Shir and Lee Spector and Alma Rahat and Richard Everson and Jonathan Fieldsend and Handing Wang and Yaochu Jin and Erik Hemberg and Marwa A. Elsayed and Michael Kommenda and William {La Cava} and Gabriel Kronberger and Steven Gustafson",
• pages = "570--573",
• address = "Boston, USA",
• series = "GECCO '22",
• month = "9-13 " # jul,
• organisation = "SIGEVO",
• publisher = "Association for Computing Machinery",
• publisher_address = "New York, NY, USA",
• keywords = "genetic algorithms, genetic programming, symbolic regression, semantic genetic programming, modularity",
• isbn13 = "978-1-4503-9268-6/22/07",
• DOI = "doi:10.1145/3520304.3529077",
• video_url = "https://vimeo.com/723511579",
• abstract = "In genetic programming, candidate solutions are compositional structures that can be easily decomposed into constituent parts and assembled from them. This property is extensively used in search operators, but rarely exploited in other stages of evolutionary search. We propose an approach to symbolic regression that augments the search state by maintaining, apart from the population of candidate solutions, a library of subprograms and a library of program contexts, i.e. partial programs that need to be supplemented by a subprogram to form a complete program. This allows us to identify the promising program components and guide search using two mechanisms in parallel: the conventional fitness-based selection pressure, and matching contexts with subprograms using a gradient-based mechanism. In experimental assessment, the approach significantly outperforms the control setups and the conventional GP. Maintaining subprograms and contexts in efficient data structures prevents redundancy and lessens the demand for computational resources, in particular memory.",
• notes = "GECCO-2022 A Recombination of the 31st International Conference on Genetic Algorithms (ICGA) and the 27th Annual Genetic Programming Conference (GP)",

}

Genetic Programming entries for Krzysztof Krawiec Dominik Kossinski

Citations