Decomposition based cross-parallel multiobjective genetic programming for symbolic regression

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

@Article{Fan:2024:asoc,

• author = "Lei Fan and Zhaobing Su and Xiyang Liu and Yuping Wang",
• title = "Decomposition based cross-parallel multiobjective genetic programming for symbolic regression",
• journal = "Applied Soft Computing",
• year = "2024",
• volume = "167",
• pages = "112239",
• keywords = "genetic algorithms, genetic programming, Symbolic regression, Problem decomposition, Global regression, Local regression, Cross-parallel multiobjective genetic programming",
• ISSN = "1568-4946",
• URL = "https://www.sciencedirect.com/science/article/pii/S1568494624010135",
• DOI = "doi:10.1016/j.asoc.2024.112239",
• abstract = "Genetic Programming (GP) based Symbolic Regression (SR) algorithms suffer from the ineluctable effects over model bloat, blind search and diversity loss when determining explicit symbolic models to best depict the concealed laws in historical data, which often make them time-consuming and unstable. Most efforts often dealt with one of these effects, such that the algorithms still suffer from other effects. To deal with these effects, we propose a cross-parallel SR algorithm framework based on problem decomposition and multiobjective GP in this paper. The decomposition method is proposed to distill simple subproblems named global and local regression, which can be fast solved to produce various high quality models. In the proposed framework, by expressing the SR problem as the multiobjective optimisation model, a number of subproblems are automatically distilled and solved in parallel to reduce model bloat and accelerate the algorithm. Traditional regression methods are employed to produce high quality models to seed the evolving populations for each subtask to maintain population diversity and improve search efficiency. Elite models obtained by each subtasks will be collected and randomly sent to other subtasks to improve the model generalisation. Ablation and comparison experiments are conducted to evaluate the performance of the proposed algorithms. The ablation results show that the developed algorithm framework plays a positive role in reducing above ineluctable effects, and can fast determine concise symbolic models for the benchmarks. Comparisons by SRBench demonstrate the effectiveness of the developed algorithm on wide range problems",

}

Genetic Programming entries for Lei Fan Zhaobing Su Xiyang Liu Yuping Wang

Citations