• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于遗传编程的符号回归中的终身学习的一种简单方法。

A simple approach to lifetime learning in genetic programming-based symbolic regression.

机构信息

CSIS Department, University of Limerick, Ireland

出版信息

Evol Comput. 2014 Summer;22(2):287-317. doi: 10.1162/EVCO_a_00111. Epub 2014 Feb 6.

DOI:10.1162/EVCO_a_00111
PMID:24079729
Abstract

Genetic programming (GP) coarsely models natural evolution to evolve computer programs. Unlike in nature, where individuals can often improve their fitness through lifetime experience, the fitness of GP individuals generally does not change during their lifetime, and there is usually no opportunity to pass on acquired knowledge. This paper introduces the Chameleon system to address this discrepancy and augment GP with lifetime learning by adding a simple local search that operates by tuning the internal nodes of individuals. Although not the first attempt to combine local search with GP, its simplicity means that it is easy to understand and cheap to implement. A simple cache is added which leverages the local search to reduce the tuning cost to a small fraction of the expected cost, and we provide a theoretical upper limit on the maximum tuning expense given the average tree size of the population and show that this limit grows very conservatively as the average tree size of the population increases. We show that Chameleon uses available genetic material more efficiently by exploring more actively than with standard GP, and demonstrate that not only does Chameleon outperform standard GP (on both training and test data) over a number of symbolic regression type problems, it does so by producing smaller individuals and it works harmoniously with two other well-known extensions to GP, namely, linear scaling and a diversity-promoting tournament selection method.

摘要

遗传编程(GP)粗略地模拟自然进化来进化计算机程序。与自然不同,个体在自然中通常可以通过一生的经验来提高适应性,而 GP 个体的适应性在其一生中通常不会改变,并且通常没有机会传递获得的知识。本文介绍了变色龙系统来解决这个差异,并通过添加一种简单的局部搜索来增加终身学习功能,该搜索通过调整个体的内部节点来进行操作。虽然不是第一次尝试将局部搜索与 GP 结合使用,但它的简单性意味着它易于理解且易于实现。添加了一个简单的缓存,利用局部搜索将调整成本降低到预期成本的一小部分,并提供了种群平均树大小给定的最大调整费用的理论上限,并表明随着种群平均树大小的增加,该上限增长非常保守。我们通过比标准 GP 更积极地探索来证明变色龙可以更有效地利用可用的遗传物质,并证明变色龙不仅在许多符号回归类型的问题上比标准 GP(在训练和测试数据上)表现更好,而且它通过产生更小的个体来实现这一点,并且与 GP 的另外两个著名扩展(即线性缩放和促进多样性的锦标赛选择方法)和谐地工作。

相似文献

1
A simple approach to lifetime learning in genetic programming-based symbolic regression.基于遗传编程的符号回归中的终身学习的一种简单方法。
Evol Comput. 2014 Summer;22(2):287-317. doi: 10.1162/EVCO_a_00111. Epub 2014 Feb 6.
2
Instruction-matrix-based genetic programming.基于指令矩阵的遗传编程
IEEE Trans Syst Man Cybern B Cybern. 2008 Aug;38(4):1036-49. doi: 10.1109/TSMCB.2008.922054.
3
Using Genetic Programming with Prior Formula Knowledge to Solve Symbolic Regression Problem.运用带有先验公式知识的遗传编程来解决符号回归问题。
Comput Intell Neurosci. 2016;2016:1021378. doi: 10.1155/2016/1021378. Epub 2015 Dec 24.
4
Learning to solve planning problems efficiently by means of genetic programming.通过遗传编程学习高效解决规划问题。
Evol Comput. 2001 Winter;9(4):387-420. doi: 10.1162/10636560152642841.
5
The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.用于可持续进化算法的分层公平竞争(HFC)框架。
Evol Comput. 2005 Summer;13(2):241-77. doi: 10.1162/1063656054088530.
6
On Using Surrogates with Genetic Programming.关于在遗传编程中使用代理变量
Evol Comput. 2015 Fall;23(3):343-67. doi: 10.1162/EVCO_a_00133. Epub 2014 Nov 24.
7
Multitask visual learning using genetic programming.使用遗传编程的多任务视觉学习
Evol Comput. 2008 Winter;16(4):439-59. doi: 10.1162/evco.2008.16.4.439.
8
Symbolic function network.符号功能网络。
Neural Netw. 2009 May;22(4):395-404. doi: 10.1016/j.neunet.2009.02.003. Epub 2009 Mar 5.
9
Automated discovery of local search heuristics for satisfiability testing.用于可满足性测试的局部搜索启发式算法的自动发现
Evol Comput. 2008 Spring;16(1):31-61. doi: 10.1162/evco.2008.16.1.31.
10
ETEA: a Euclidean minimum spanning tree-based evolutionary algorithm for multi-objective optimization.ETEA:一种基于欧式最小生成树的多目标优化进化算法。
Evol Comput. 2014 Summer;22(2):189-230. doi: 10.1162/EVCO_a_00106. Epub 2013 Oct 30.

引用本文的文献

1
Incentive Based Load Shedding Management in a Microgrid Using Combinatorial Auction with IoT Infrastructure.基于激励的微电网负荷削减管理:结合物联网基础设施的组合拍卖方法
Sensors (Basel). 2021 Mar 10;21(6):1935. doi: 10.3390/s21061935.