现在是时候从新的角度来看待如何在GP中对抗膨胀了
It is Time for New Perspectives on How to Fight Bloat in GP
摘要:
进化算法的现在和未来取决于现代并行和分布式计算基础设施的正确使用。虽然顺序方法仍然占主导地位的景观,可用的多核,众核和分布式系统将使用户和研究人员更频繁地部署并行版本的算法。在这种情况下,在对个人进行平行评价时节省时间方面出现了新的可能性。这种时间节省在遗传编程中尤其重要。本文研究了在并行/分布式系统中,计算时间不仅影响求解时间,而且可能影响种群中个体的规模演化,最终将减少GP特征的膨胀现象。本文在设计一种更自然的对抗肿胀的方法时,将时间和空间视为一枚硬币的两面。这种新的视角使我们能够理解,可以推导出控制膨胀的新方法,并描述和测试了这种方法的第一种。实验数据证实了这种方法的优势:使用计算时间作为个体复杂性的度量,可以控制遗传编程个体大小的增长。
英文摘要:
The present and future of evolutionary algorithms depends on the proper use of modern parallel and distributed computing infrastructures. Although still sequential approaches dominate the landscape, available multi-core, many-core and distributed systems will make users and researchers to more frequently deploy parallel version of the algorithms. In such a scenario, new possibilities arise regarding the time saved when parallel evaluation of individuals are performed. And this time saving is particularly relevant in Genetic Programming. This paper studies how evaluation time influences not only time to solution in parallel/distributed systems, but may also affect size evolution of individuals in the population, and eventually will reduce the bloat phenomenon GP features. This paper considers time and space as two sides of a single coin when devising a more natural method for fighting bloat. This new perspective allows us to understand that new methods for bloat control can be derived, and the first of such a method is described and tested. Experimental data confirms the strength of the approach: using computing time as a measure of individuals' complexity allows to control the growth in size of genetic programming individuals.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。