M5GP: Parallel Multidimensional Genetic Programming with Multidimensional Populations for Symbolic Regression

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

@Article{cardenas-florido:2024:MaCA,

• author = "Luis {Cardenas Florido} and Leonardo Trujillo and Daniel E. Hernandez and Jose Manuel {Munoz Contreras}",
• title = "{M5GP:} Parallel Multidimensional Genetic Programming with Multidimensional Populations for Symbolic Regression",
• journal = "Mathematical and Computational Applications",
• year = "2024",
• volume = "29",
• number = "2",
• pages = "Article No. 25",
• keywords = "genetic algorithms, genetic programming",
• ISSN = "2297-8747",
• URL = "https://www.mdpi.com/2297-8747/29/2/25",
• DOI = "doi:10.3390/mca29020025",
• abstract = "Machine learning and artificial intelligence are growing in popularity thanks to their ability to produce models that exhibit unprecedented performance in domains that include computer vision, natural language processing and code generation. However, such models tend to be very large and complex and impossible to understand using traditional analysis or human scrutiny. Conversely, Symbolic Regression methods attempt to produce models that are relatively small and (potentially) human-readable. In this domain, Genetic Programming (GP) has proven to be a powerful search strategy that achieves state-of-the-art performance. This paper presents a new GP-based feature transformation method called M5GP, which is hybridized with multiple linear regression to produce linear models, implemented to exploit parallel processing on graphical processing units for efficient computation. M5GP is the most recent variant from a family of feature transformation methods (M2GP, M3GP and M4GP) that have proven to be powerful tools for both classification and regression tasks applied to tabular data. The proposed method was evaluated on SRBench v2.0, the current standard benchmarking suite for Symbolic Regression. Results show that M5GP achieves performance that is competitive with the state-of-the-art, achieving a top-three rank on the most difficult subset of black-box problems. Moreover, it achieves the lowest computation time when compared to other GP-based methods that have similar accuracy scores.",
• notes = "also known as \cite{mca29020025}",

}

Genetic Programming entries for Luis Cardenas Florido Leonardo Trujillo Daniel Eduardo Hernandez Morales Jose Manuel Munoz Contreras

Citations