词格选择与ε-词格选择的概率多目标分析
A probabilistic and multi-objective analysis of lexicase selection and epsilon-lexicase selection
摘要:
词典选择是一种父选择方法,它在执行父选择时单独考虑训练案例,而不是聚合。鉴于以前的工作已经证明了词典选择解决困难的问题,在程序合成和符号回归的能力,本文的中心目标是发展的理论基础,解释其性能。为此,我们推导出一个分析公式,给出了预期的概率选择下词典选择,给定的人口及其行为。此外,我们扩展的词库选择的关系,多目标优化方法来描述词库选择的行为,这是选择的帕累托前沿的边界上的高维空间中的个人。我们分析了为什么词典选择在一定规模的人群和训练案例中表现得更差,以及为什么它在连续错误空间中表现得更差。为了解决这最后一个问题,我们提出了新的变体ε词典选择,一种方法,修改词典选择的通过条件,允许近精英个人通过的情况下,从而提高选择性能与连续错误。我们表明,ε-lexicase优于几个多样性维护策略的一些现实世界和合成回归问题。
英文摘要:
Lexicase selection is a parent selection method that considers training cases individually, rather than in aggregate, when performing parent selection. Whereas previous work has demonstrated the ability of lexicase selection to solve difficult problems in program synthesis and symbolic regression, the central goal of this paper is to develop the theoretical underpinnings that explain its performance. To this end, we derive an analytical formula that gives the expected probabilities of selection under lexicase selection, given a population and its behavior. In addition, we expand upon the relation of lexicase selection to many-objective optimization methods to describe the behavior of lexicase selection, which is to select individuals on the boundaries of Pareto fronts in high-dimensional space. We show analytically why lexicase selection performs more poorly for certain sizes of population and training cases, and show why it has been shown to perform more poorly in continuous error spaces. To address this last concern, we propose new variants of epsilon-lexicase selection, a method that modifies the pass condition in lexicase selection to allow near-elite individuals to pass cases, thereby improving selection performance with continuous errors. We show that epsilon-lexicase outperforms several diversity-maintenance strategies on a number of real-world and synthetic regression problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。