Relieving Genetic Programming from Coefficient Learning for Symbolic Regression via Correlation and Linear Scaling

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

@InProceedings{chen:2023:GECCO,

• author = "Qi Chen and Bing Xue and Wolfgang Banzhaf and Mengjie Zhang",
• title = "Relieving Genetic Programming from Coefficient Learning for Symbolic Regression via Correlation and Linear Scaling",
• 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 = "420--428",
• 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, fitness function, correlation, linear scaling, symbolic regression",
• isbn13 = "9798400701191",
• DOI = "doi:10.1145/3583131.3595918",
• size = "9 pages",
• abstract = "The difficulty of learning optimal coefficients in regression models using only genetic operators has long been a challenge in genetic programming for symbolic regression. As a simple but effective remedy it has been proposed to perform linear scaling of model outputs prior to a fitness evaluation. Recently, the use of a correlation coefficient-based fitness function with a post-processing linear scaling step for model alignment has been shown to outperform error-based fitness functions in generating symbolic regression models. In this study, we compare the impact of four evaluation strategies on relieving genetic programming (GP) from learning coefficients in symbolic regression and focusing on learning the more crucial model structure. The results from 12 datasets, including ten real-world tasks and two synthetic datasets, confirm that all these strategies assist GP to varying degrees in learning coefficients. Among the them, correlation fitness with one-time linear scaling as post-processing, due to be the most efficient while bringing notable benefits to the performance, is the recommended strategy to relieve GP from learning coefficients.",
• 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 Qi Chen Bing Xue Wolfgang Banzhaf Mengjie Zhang

Citations