arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1807.02397cs.NE
收藏

通过惊喜实现质量多样性

Quality Diversity Through Surprise

Daniele Gravina, Antonios Liapis, Georgios N. Yannakakis

摘要:

质量多样性是一个最近的家庭的进化搜索算法,其重点是找到几个性能良好的(质量),但不同的(多样性)的解决方案,目的是保持一个适当的平衡之间的分歧和收敛搜索。虽然质量多样性已经在复杂问题中取得了令人鼓舞的结果,但质量多样性的发散搜索变体的能力在很大程度上仍未被探索。受惊奇作为发散搜索的有效驱动力及其与新颖性正交的概念的启发,本文研究了前者对质量多样性性能的影响。为了这个目的,我们引入了三个新的质量多样性算法,采用惊喜作为多样性的措施,无论是自己或结合新颖性,并比较其性能对新颖性搜索与本地竞争,最先进的质量多样性算法。该算法在机器人导航任务中测试了60个高度欺骗性的迷宫。我们的研究结果表明,允许惊喜和新颖性协同运作的分歧,并结合本地竞争导致质量多样性算法的显着更高的效率,速度和鲁棒性。

英文摘要:

Quality diversity is a recent family of evolutionary search algorithms which focus on finding several well-performing (quality) yet different (diversity) solutions with the aim to maintain an appropriate balance between divergence and convergence during search. While quality diversity has already delivered promising results in complex problems, the capacity of divergent search variants for quality diversity remains largely unexplored. Inspired by the notion of surprise as an effective driver of divergent search and its orthogonal nature to novelty this paper investigates the impact of the former to quality diversity performance. For that purpose we introduce three new quality diversity algorithms which employ surprise as a diversity measure, either on its own or combined with novelty, and compare their performance against novelty search with local competition, the state of the art quality diversity algorithm. The algorithms are tested in a robot navigation task across 60 highly deceptive mazes. Our findings suggest that allowing surprise and novelty to operate synergistically for divergence and in combination with local competition leads to quality diversity algorithms of significantly higher efficiency, speed and robustness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑