通过行为支配发现进化的垫脚石
Discovering Evolutionary Stepping Stones through Behavior Domination
摘要:
行为支配被认为是理解和利用进化系统的力量来发现和利用有用的垫脚石的工具。新颖性搜索已经显示出通过收集不同的垫脚石来克服欺骗的希望,并且已经提出了几种算法,这些算法将新颖性与更传统的适应度度量相结合,以重新聚焦搜索,并帮助新颖性搜索扩展到更复杂的领域。然而,新颖性和适应性的结合并不一定能保持新颖性搜索所提供的垫脚石发现。在几种现有的方法中,解决方案之间的竞争可能导致多样性的意外损失。行为支配定义了一类避免这个问题的算法,同时继承了多目标优化的理论保证。几个现有的算法被证明是在这一类,并介绍了一个新的算法的基础上快速非支配排序。实验结果表明,该算法优于现有的方法在域中包含有用的垫脚石,其优势是持续的规模。结论是,行为支配可以帮助阐明行为驱动搜索的复杂动力学,从而可以设计出更具可扩展性和鲁棒性的算法。
英文摘要:
Behavior domination is proposed as a tool for understanding and harnessing the power of evolutionary systems to discover and exploit useful stepping stones. Novelty search has shown promise in overcoming deception by collecting diverse stepping stones, and several algorithms have been proposed that combine novelty with a more traditional fitness measure to refocus search and help novelty search scale to more complex domains. However, combinations of novelty and fitness do not necessarily preserve the stepping stone discovery that novelty search affords. In several existing methods, competition between solutions can lead to an unintended loss of diversity. Behavior domination defines a class of algorithms that avoid this problem, while inheriting theoretical guarantees from multiobjective optimization. Several existing algorithms are shown to be in this class, and a new algorithm is introduced based on fast non-dominated sorting. Experimental results show that this algorithm outperforms existing approaches in domains that contain useful stepping stones, and its advantage is sustained with scale. The conclusion is that behavior domination can help illuminate the complex dynamics of behavior-driven search, and can thus lead to the design of more scalable and robust algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。