Cellular geometric semantic genetic programming

IF 1.7 3区 计算机科学 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Lorenzo Bonin, Luigi Rovito, Andrea De Lorenzo, Luca Manzoni
{"title":"Cellular geometric semantic genetic programming","authors":"Lorenzo Bonin, Luigi Rovito, Andrea De Lorenzo, Luca Manzoni","doi":"10.1007/s10710-024-09480-8","DOIUrl":null,"url":null,"abstract":"<p>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 <i>semantics</i> 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 <i>n</i>-dimensional periodic grid and communicates only locally with the automata in their neighbourhoods. Similarly, we assign a location to each individual on an <i>n</i>-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 <i>cellular GSGP</i> (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.</p>","PeriodicalId":50424,"journal":{"name":"Genetic Programming and Evolvable Machines","volume":"402 1","pages":""},"PeriodicalIF":1.7000,"publicationDate":"2024-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Genetic Programming and Evolvable Machines","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s10710-024-09480-8","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

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.

Abstract Image

细胞几何语义遗传编程
在遗传编程(GP)的各种变体中,几何语义 GP(GSGP)已被证明在寻找好的解决方案方面既高效又有效。GSGP 的运算符以明确的方式对个体的语义进行运算,这为搜索方式提供了保证。不过,GSGP 也有其局限性,比如种群会过早收敛到搜索空间的一小块区域,而且可能是次优区域。造成这一问题的原因之一可能是,优秀个体会在种群中迅速 "扩散",从而抑制竞争的出现。为了缓解这一问题,我们在 GSGP 上采用了受细胞自动机(CA)启发的通信拓扑结构。在蜂窝自动机中,代理集合(作为有限状态自动机)被放置在一个 n 维的周期性网格中,只与其邻近的自动机进行局部通信。同样,我们为 n 维网格中的每个个体分配一个位置,个体的整个进化过程将在本地进行,每个个体只考虑其邻域中的个体。具体来说,我们提出了一种算法,在这种算法中,每一代都会对每个个体的邻域子集进行采样,并通过提取该子集中的两个最佳个体来对网格中的给定单元进行选择,这两个个体将被用作几何语义交叉的父代。我们在八个回归问题上比较了这种蜂窝 GSGP(cGSGP)方法和标准 GSGP,结果表明它能提供比 GSGP 更好的解决方案。此外,通过分析收敛率,我们发现无论执行多少代,都能观察到改进。此外,我们还表明,将基于小邻域的蜂窝空间结构与 GSGP 结合,有助于产生更小的解。最后,我们采用莫兰 I 系数来测量种群的空间自相关性,以提供多样性概览,这表明我们的蜂窝空间结构有助于在演化的早期阶段提供更好的多样性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Genetic Programming and Evolvable Machines
Genetic Programming and Evolvable Machines 工程技术-计算机:理论方法
CiteScore
5.90
自引率
3.80%
发文量
19
审稿时长
6 months
期刊介绍: A unique source reporting on methods for artificial evolution of programs and machines... Reports innovative and significant progress in automatic evolution of software and hardware. Features both theoretical and application papers. Covers hardware implementations, artificial life, molecular computing and emergent computation techniques. Examines such related topics as evolutionary algorithms with variable-size genomes, alternate methods of program induction, approaches to engineering systems development based on embryology, morphogenesis or other techniques inspired by adaptive natural systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信