Population Dynamics in Genetic Programming for Dynamic Symbolic Regression

被引:2
作者
Fleck, Philipp [1 ,2 ,3 ]
Werth, Bernhard [1 ,2 ,3 ]
Affenzeller, Michael [1 ,2 ]
机构
[1] Univ Appl Sci Upper Austria, Heurist & Evolutionary Algorithms Lab, A-4232 Hagenberg, Austria
[2] Johannes Kepler Univ Linz, Inst Symbol Artificial Intelligence, A-4040 Linz, Austria
[3] Univ Appl Sci Upper Austria, Josef Ressel Ctr Adapt Optimizat Dynam Environm, A-4232 Hagenberg, Austria
来源
APPLIED SCIENCES-BASEL | 2024年 / 14卷 / 02期
关键词
genetic programming; dynamic optimization; symbolic regression; OPTIMIZATION;
D O I
10.3390/app14020596
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
This paper investigates the application of genetic programming (GP) for dynamic symbolic regression (SR), addressing the challenge of adapting machine learning models to evolving data in practical applications. Benchmark instances with changing underlying functions over time are defined to assess the performance of a genetic algorithm (GA) as a traditional evolutionary algorithm and an age-layered population structure (ALPS) as an open-ended evolutionary algorithm for dynamic symbolic regression. This study analyzes population dynamics by examining variable frequencies and impact changes over time in response to dynamic shifts in the training data. The results demonstrate the effectiveness of both the GA and ALPS in handling changing data, showcasing their ability to recover and evolve improved solutions after an initial drop in population quality following data changes. Population dynamics reveal that variable impacts respond rapidly to data changes, while variable frequencies shift gradually across generations, aligning with the indirect measure of fitness represented by variable impacts. Notably, the GA shows a strong dependence on mutation to avoid variables becoming permanently extinct, contrasting with the ALPS's unexpected insensitivity to mutation rates owing to its reseeding mechanism for effective variable reintroduction.
引用
收藏
页数:24
相关论文
共 44 条
[1]   Implicit memory-based technique in solving dynamic scheduling problems through Response Surface Methodology - Part II Experiments and analysis [J].
Abello, Manuel Blanco ;
Michalewicz, Zbigniew .
INTERNATIONAL JOURNAL OF INTELLIGENT COMPUTING AND CYBERNETICS, 2014, 7 (02) :143-174
[2]   Offspring selection: A new self-adaptive selection scheme for genetic algorithms [J].
Affenzeller, M ;
Wagner, S .
ADAPTIVE AND NATURAL COMPUTING ALGORITHMS, 2005, :218-221
[3]   On the elusivity of dynamic optimisation problems [J].
Alza, Joan ;
Bartlett, Mark ;
Ceberio, Josu ;
McCall, John .
SWARM AND EVOLUTIONARY COMPUTATION, 2023, 78
[4]  
[Anonymous], 2001, TIK report 103, DOI DOI 10.3929/ETHZ-A-004284029
[5]  
Banzhaf W., 1998, GENETIC PROGRAMMING
[6]  
Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
[7]  
Branke Jurgen., 2012, Evolutionary optimization in dynamic environments, V3
[8]   SEDE-GPS: socio-economic data enrichment based on GPS information [J].
Sperlea, Theodor ;
Fueser, Stefan ;
Boenigk, Jens ;
Heider, Dominik .
BMC BIOINFORMATICS, 2018, 19
[9]   Dynamic Optimization using Self-Adaptive Differential Evolution [J].
Brest, Janez ;
Zamuda, Ales ;
Boskovic, Borko ;
Maucec, Mirjam Sepesy ;
Zumer, Viljem .
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, :415-422
[10]   A Novel Evolutionary Algorithm for Dynamic Constrained Multiobjective Optimization Problems [J].
Chen, Qingda ;
Ding, Jinliang ;
Yang, Shengxiang ;
Chai, Tianyou .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (04) :792-806