面向符号回归问题的多形式遗传编程框架

Multiform Genetic Programming Framework for Symbolic Regression Problems

IEEE Transactions on Evolutionary Computation · 2025
被引 8 · 同刊同年前 10%
ABS 4

中文导读

提出一种多形式遗传编程框架,通过构建多种模型形式协同求解符号回归问题,并设计知识迁移和资源自适应分配机制,在20个数据集上验证了有效性。

Abstract

Genetic programming (GP) is a widely recognized and powerful approach for symbolic regression (SR) problems. However, existing GP methods rely on a single form to solve the problem, which limits their search diversity and increases the likelihood of getting stuck in local optima, especially in complex scenarios. In this paper, we propose a general multiform GP framework to improve the performance of GP on complicated SR problems. As far as we know, this paper is the first attempt to integrate the multiform optimization paradigm with GP to accelerate the search performance. The key idea of the proposed framework is to construct multiple forms to solve the same problem cooperatively at the same time. During the evolution process, knowledge gained from different forms is shared among the solvers to improve the search diversity and efficiency. A knowledge transfer mechanism is specifically designed to facilitate knowledge transfer among GP solvers with different modeling forms. In addition, an adaptive resource control mechanism is designed to reallocate computing resources according to the problem-solving efficiency of different solvers to further improve search efficiency. To demonstrate the effectiveness of the proposed framework, a multiform GEP algorithm (MF-GEP) is designed and tested on 20 problems, including physical datasets, synthetic datasets, and real-world datasets. The experimental results have demonstrated the effectiveness of the proposed framework.

符号回归遗传编程机器学习人工智能优化算法