Symbolic Regression-Assisted Offline Data-Driven Evolutionary Computation

IF 11.7 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Evolutionary Computation Pub Date : 2024-10-17 DOI:10.1109/TEVC.2024.3482326
Yu-Hong Sun;Ting Huang;Jing-Hui Zhong;Jun Zhang;Yue-Jiao Gong
{"title":"Symbolic Regression-Assisted Offline Data-Driven Evolutionary Computation","authors":"Yu-Hong Sun;Ting Huang;Jing-Hui Zhong;Jun Zhang;Yue-Jiao Gong","doi":"10.1109/TEVC.2024.3482326","DOIUrl":null,"url":null,"abstract":"When solving optimization problems with expensive or implicit objective functions, evolutionary algorithms (EAs) commonly utilize surrogate models as cost-effective substitutes for evaluation. This category of algorithms is referred to as data-driven EAs (DDEAs). However, when constructing surrogate models, existing studies rely on the hand-crafted model structure, requiring prior knowledge while leading to the suboptimal fitting ability of the model. To address the issue, this article proposes a novel symbolic regression (SR)-assisted EA, namely SR-DDEA. SR-DDEA employs SR to automatically construct the model structure without prior knowledge and obtain accurate surrogates. Specifically, we develop an efficient gene expression programming algorithm to enhance the expressive ability of surrogates, assisted by a queue-based decoding strategy to improve the efficiency of the model calculations. We also employ a clustering-based selective ensemble method to maximize data utilization and obtain diverse models. Experimental findings on commonly employed benchmarks demonstrate that our algorithm surpasses other cutting-edge offline DDEAs on test problems of different scales and a practical aerodynamic airfoil design challenge.","PeriodicalId":13206,"journal":{"name":"IEEE Transactions on Evolutionary Computation","volume":"29 5","pages":"2158-2172"},"PeriodicalIF":11.7000,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10720865/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

When solving optimization problems with expensive or implicit objective functions, evolutionary algorithms (EAs) commonly utilize surrogate models as cost-effective substitutes for evaluation. This category of algorithms is referred to as data-driven EAs (DDEAs). However, when constructing surrogate models, existing studies rely on the hand-crafted model structure, requiring prior knowledge while leading to the suboptimal fitting ability of the model. To address the issue, this article proposes a novel symbolic regression (SR)-assisted EA, namely SR-DDEA. SR-DDEA employs SR to automatically construct the model structure without prior knowledge and obtain accurate surrogates. Specifically, we develop an efficient gene expression programming algorithm to enhance the expressive ability of surrogates, assisted by a queue-based decoding strategy to improve the efficiency of the model calculations. We also employ a clustering-based selective ensemble method to maximize data utilization and obtain diverse models. Experimental findings on commonly employed benchmarks demonstrate that our algorithm surpasses other cutting-edge offline DDEAs on test problems of different scales and a practical aerodynamic airfoil design challenge.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
符号回归辅助离线数据驱动的进化计算
当解决具有昂贵或隐式目标函数的优化问题时,进化算法(EAs)通常使用替代模型作为经济有效的评估替代品。这类算法被称为数据驱动的ea (ddea)。然而,在构建代理模型时,现有的研究依赖于手工制作的模型结构,需要先验知识,导致模型的拟合能力不佳。为了解决这个问题,本文提出了一种新的符号回归(SR)辅助EA,即SR- ddea。SR- ddea利用SR在不需要先验知识的情况下自动构造模型结构,获得准确的代物。具体而言,我们开发了一种高效的基因表达编程算法来增强代理的表达能力,并辅以基于队列的解码策略来提高模型计算的效率。我们还采用了一种基于聚类的选择性集成方法来最大限度地利用数据并获得多样化的模型。在常用基准上的实验结果表明,我们的算法在不同规模的测试问题和实际气动翼型设计挑战上优于其他前沿的离线ddea。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation 工程技术-计算机:理论方法
CiteScore
21.90
自引率
9.80%
发文量
196
审稿时长
3.6 months
期刊介绍: The IEEE Transactions on Evolutionary Computation is published by the IEEE Computational Intelligence Society on behalf of 13 societies: Circuits and Systems; Computer; Control Systems; Engineering in Medicine and Biology; Industrial Electronics; Industry Applications; Lasers and Electro-Optics; Oceanic Engineering; Power Engineering; Robotics and Automation; Signal Processing; Social Implications of Technology; and Systems, Man, and Cybernetics. The journal publishes original papers in evolutionary computation and related areas such as nature-inspired algorithms, population-based methods, optimization, and hybrid systems. It welcomes both purely theoretical papers and application papers that provide general insights into these areas of computation.
期刊最新文献
Dynamic Grouping With a Self-Aware Computational Resource Allocation for Large-Scale Multi-Objective Optimization Leader–Follower Disagreement Minimization in Social Networks ENERGIZE: A Neuroevolution Framework for Energy-Efficient Machine Learning Two-Stage Clustering and Independent Competing-Based Evolutionary Algorithm for Multimodal Multiobjective Optimization A Surrogate-Assisted High-Dimensional Mixed-Variable Evolutionary Framework and its Application to Vehicle Lightweighting Design
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1