Dynamical Sphere Regrouping Particle Swarm Optimization Programming: An Automatic Programming Algorithm Avoiding Premature Convergence

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

@Article{montes-rivera:2024:Mathematics,

• author = "Martin {Montes Rivera} and Carlos Guerrero-Mendez and Daniela Lopez-Betancur and Tonatiuh Saucedo-Anaya",
• title = "Dynamical Sphere Regrouping Particle Swarm Optimization Programming: An Automatic Programming Algorithm Avoiding Premature Convergence",
• journal = "Mathematics",
• year = "2024",
• volume = "12",
• number = "19",
• pages = "Article No. 3021",
• keywords = "genetic algorithms, genetic programming, PSO",
• ISSN = "2227-7390",
• URL = "https://www.mdpi.com/2227-7390/12/19/3021",
• DOI = "doi:10.3390/math12193021",
• abstract = "Symbolic regression plays a crucial role in machine learning and data science by allowing the extraction of meaningful mathematical models directly from data without imposing a specific structure. This level of adaptability is especially beneficial in scientific and engineering fields, where comprehending and articulating the underlying data relationships is just as important as making accurate predictions. Genetic Programming (GP) has been extensively used for symbolic regression and has demonstrated remarkable success in diverse domains. However, GP's heavy reliance on evolutionary mechanisms makes it computationally intensive and challenging to handle. On the other hand, Particle Swarm Optimisation (PSO) has demonstrated remarkable performance in numerical optimisation with parallelism, simplicity, and rapid convergence. These attributes position PSO as a compelling option for Automatic Programming (AP), which focuses on the automatic generation of programs or mathematical models. Particle Swarm Programming (PSP) has emerged as an alternative to Genetic Programming (GP), with a specific emphasis on harnessing the efficiency of PSO for symbolic regression. However, PSP remains unsolved due to the high-dimensional search spaces and local optimal regions in AP, where traditional PSO can encounter issues such as premature convergence and stagnation. To tackle these challenges, we introduce Dynamical Sphere Regrouping PSO Programming (DSRegPSOP), an innovative PSP implementation that integrates DSRegPSO's dynamical sphere regrouping and momentum conservation mechanisms. DSRegPSOP is specifically developed to deal with large-scale, high-dimensional search spaces featuring numerous local optima, thus proving effective behaviour for symbolic regression tasks. We assess DSRegPSOP by generating 10 mathematical expressions for mapping points from functions with varying complexity, including noise in position and cost evaluation. Moreover, we also evaluate its performance using real-world datasets. Our results show that DSRegPSOP effectively addresses the shortcomings of PSO in PSP by producing mathematical models entirely generated by AP that achieve accuracy similar to other machine learning algorithms optimised for regression tasks involving numerical structures. Additionally, DSRegPSOP combines the benefits of symbolic regression with the efficiency of PSO.",
• notes = "also known as \cite{math12193021}",

}

Genetic Programming entries for Martin Montes Rivera Carlos Guerrero-Mendez Daniela Lopez-Betancur Tonatiuh Saucedo-Anaya

Citations