Error and Correlation as Fitness Functions for Scaled Symbolic Regression in Grammatical Evolution

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

@InProceedings{murphy:2023:GECCOcomp,

• author = "Aidan Murphy and Allan {De Lima} and Douglas {Mota Dias} and Conor Ryan",
• title = "Error and Correlation as Fitness Functions for Scaled Symbolic Regression in Grammatical Evolution",
• booktitle = "Proceedings of the 2023 Genetic and Evolutionary Computation Conference",
• year = "2023",
• editor = "Sara Silva and Luis Paquete and Leonardo Vanneschi and Nuno Lourenco and Ales Zamuda and Ahmed Kheiri and Arnaud Liefooghe and Bing Xue and Ying Bi and Nelishia Pillay and Irene Moser and Arthur Guijt and Jessica Catarino and Pablo Garcia-Sanchez and Leonardo Trujillo and Carla Silva and Nadarajen Veerapen",
• pages = "607--610",
• address = "Lisbon, Portugal",
• series = "GECCO '23",
• month = "15-19 " # jul,
• organisation = "SIGEVO",
• publisher = "Association for Computing Machinery",
• publisher_address = "New York, NY, USA",
• keywords = "genetic algorithms, genetic programming, grammatical evolution, symbolic regression, linear scaling: Poster",
• isbn13 = "9798400701191",
• DOI = "doi:10.1145/3583133.3590709",
• size = "4 pages",
• abstract = "Linear scaling has greatly improved the performance of genetic programming when performing symbolic regression. Linear scaling transforms the output of an expression to reduce its error. Mean squared error and correlation have been used with scaling, often interchangeably and with assumed equivalence. We examine if this equivalence is justified by investigating the differences between an error-based metric and a correlation-based metric on 11 well-known symbolic regression benchmarks. We investigate the effect a change of fitness function has on performance, individuals size and diversity. Error-based scaling and Correlation were seen to attain equivalent performance and found solutions with very similar size and diversity on the majority of problem, but not all. In order to ascertain if the strengths of both approaches could be combined, we explored a double tournament selection strategy, where two tournaments are conducted sequentially to select individuals for recombination. Double tournament selection found smaller solutions and the best solution in five benchmarks, including finding the best solutions on both real-world dataset used in our experiments.",
• notes = "GECCO-2023 A Recombination of the 32nd International Conference on Genetic Algorithms (ICGA) and the 28th Annual Genetic Programming Conference (GP)",

}

Genetic Programming entries for Aidan Murphy Allan De Lima Douglas Mota Dias Conor Ryan

Citations