Cellular geometric semantic genetic programming

被引:0
|
作者
Bonin, Lorenzo [1 ]
Rovito, Luigi [1 ]
De Lorenzo, Andrea [2 ]
Manzoni, Luca [1 ]
机构
[1] Univ Trieste, Dipartimento Matemat & Geosci, Via Alfonso Valerio 12-1, I-34127 Trieste, TS, Italy
[2] Univ Trieste, Dipartimento Ingn & Architettura, Via Alfonso Valerio 6-1, I-34127 Trieste, TS, Italy
关键词
Geometric semantic genetic programming; Genetic programming; Cellular genetic programming; SPATIAL DEPENDENCE; PREDICTION; ALGORITHMS; SELECTION;
D O I
10.1007/s10710-024-09480-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Among the different variants of Genetic Programming (GP), Geometric Semantic GP (GSGP) has proved to be both efficient and effective in finding good solutions. The fact that the operators of GSGP operate on the semantics of the individuals in a clear way provides guarantees on the way the search is performed. GSGP is not, however, free from limitations like the premature convergence of the population to a small-and possibly sub-optimal-area of the search space. One reason for this issue could be the fact that good individuals can quickly "spread" in the population suppressing the emergence of competition. To mitigate this problem, we impose a cellular automata (CA) inspired communication topology over GSGP. In CAs a collection of agents (as finite state automata) are positioned in a n-dimensional periodic grid and communicates only locally with the automata in their neighbourhoods. Similarly, we assign a location to each individual on an n-dimensional grid and the entire evolution for an individual will happen locally by considering, for each individual, only the individuals in its neighbourhood. Specifically, we present an algorithm in which, for each generation, a subset of the neighbourhood of each individual is sampled and the selection for the given cell in the grid is performed by extracting the two best individuals of this subset, which are employed as parents for the Geometric Semantic Crossover. We compare this cellular GSGP (cGSGP) approach with standard GSGP on eight regression problems, showing that it can provide better solutions than GSGP. Moreover, by analyzing convergence rates, we show that the improvement is observable regardless of the number of executed generations. As a side effect, we additionally show that combining a small-neighbourhood-based cellular spatial structure with GSGP helps in producing smaller solutions. Finally, we measure the spatial autocorrelation of the population by adopting the Moran's I coefficient to provide an overview of the diversity, showing that our cellular spatial structure helps in providing better diversity during the early stages of the evolution.
引用
收藏
页数:32
相关论文
共 50 条
  • [1] An Introduction to Geometric Semantic Genetic Programming
    Vanneschi, Leonardo
    [J]. NEO 2015, 2017, 663 : 3 - 42
  • [2] Geometric Semantic Genetic Programming Is Overkill
    Pawlak, Tomasz P.
    [J]. GENETIC PROGRAMMING, EUROGP 2016, 2016, 9594 : 246 - 260
  • [3] Instance Selection for Geometric Semantic Genetic Programming
    Miranda, Luis Fernando
    Oliveira, Luiz Otavio V. B.
    Martins, Joao Francisco B. S.
    Pappa, Gisele L.
    [J]. 2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2020,
  • [4] On the Generalization Ability of Geometric Semantic Genetic Programming
    Goncalves, Ivo
    Silva, Sara
    Fonseca, Carlos M.
    [J]. GENETIC PROGRAMMING (EUROGP 2015), 2015, 9025 : 41 - 52
  • [5] Geometric Semantic Genetic Programming with Local Search
    Castelli, Mauro
    Trujillo, Leonardo
    Vanneschi, Leonardo
    Silva, Sara
    Z-Flores, Emigdio
    Legrand, Pierrick
    [J]. GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 999 - 1006
  • [6] Geometric Semantic Genetic Programming for Financial Data
    McDermott, James
    Agapitos, Alexandros
    Brabazon, Anthony
    O'Neill, Michael
    [J]. APPLICATIONS OF EVOLUTIONARY COMPUTATION, 2014, 8602 : 215 - 226
  • [7] Subtree semantic geometric crossover for genetic programming
    Quang Uy Nguyen
    Tuan Anh Pham
    Xuan Hoai Nguyen
    McDermott, James
    [J]. GENETIC PROGRAMMING AND EVOLVABLE MACHINES, 2016, 17 (01) : 25 - 53
  • [8] Subtree semantic geometric crossover for genetic programming
    Quang Uy Nguyen
    Tuan Anh Pham
    Xuan Hoai Nguyen
    James McDermott
    [J]. Genetic Programming and Evolvable Machines, 2016, 17 : 25 - 53
  • [9] A Dispersion Operator for Geometric Semantic Genetic Programming
    Oliveira, Luiz Otavio V. B.
    Otero, Fernando E. B.
    Pappa, Gisele L.
    [J]. GECCO'16: PROCEEDINGS OF THE 2016 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2016, : 773 - 780
  • [10] Cartesian Genetic Programming as an Optimizer of Programs Evolved with Geometric Semantic Genetic Programming
    Koncal, Ondrej
    Sekanina, Lukas
    [J]. GENETIC PROGRAMMING, EUROGP 2019, 2019, 11451 : 98 - 113