论文标题
人口多样性导致词汇酶选择的短期运行时间
Population Diversity Leads to Short Running Times of Lexicase Selection
论文作者
论文摘要
在本文中，我们调查了为什么词汇酶父母选择的运行时间在经验上远低于其最差的O（N*C）的最差案例。我们定义了人口多样性的度量，并证明高多样性导致词汇酶选择的运行时间较低。然后，我们从经验上表明，在词汇酶选择下进化的遗传编程人群对于几种程序合成问题是多种多样的，并探讨了运行时间范围的产生差异。
In this paper we investigate why the running time of lexicase parent selection is empirically much lower than its worst-case bound of O(N*C). We define a measure of population diversity and prove that high diversity leads to low running times O(N + C) of lexicase selection. We then show empirically that genetic programming populations evolved under lexicase selection are diverse for several program synthesis problems, and explore the resulting differences in running time bounds.
