arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1005.3566cs.LG
收藏

目标漂移的进化

Evolution with Drifting Targets

Harvard University(哈佛大学)

Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan

摘要:

我们认为进化算法的稳定性的问题逐渐变化,或漂移,在目标的概念。我们定义一个算法是抗漂移的,如果对于目标函数中的一些逆多项式漂移率,它收敛到精度1 - ε,多项式资源,然后在任何一个时间无限期地保持在该精度内,除了概率ε。我们证明了每一个进化算法,在Valiant(2007; 2009)的意义上,可以使用Feldman(2008)的相关查询技术转换成这样一个抗漂移算法。对于某些进化算法,如布尔合取,我们给出了他们可以抵抗的漂移率的界限。我们开发了一些新的进化算法,是抗重大漂移。特别地,我们给出了一个算法的球对称分布,是抵抗O(ε/n)的漂移率,和另一个算法的更一般的产品正态分布,抵抗一个较小的漂移率。上述翻译结果也可以解释为在定义改变的情况下演化概念本身的稳健性。作为第二个结果,在这个方向上,我们表明,每一个进化算法可以转换为一个准单调的,可以从任何起始点的性能没有下降显着低于起始点。这允许从几个已知的鲁棒性转换中删除任意性能降级的有点不自然的特征。

英文摘要:

We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for some inverse polynomial drift rate in the target function, it converges to accuracy 1 -- ε, with polynomial resources, and then stays within that accuracy indefinitely, except with probability ε, at any one time. We show that every evolution algorithm, in the sense of Valiant (2007; 2009), can be converted using the Correlational Query technique of Feldman (2008), into such a drift resistant algorithm. For certain evolutionary algorithms, such as for Boolean conjunctions, we give bounds on the rates of drift that they can resist. We develop some new evolution algorithms that are resistant to significant drift. In particular, we give an algorithm for evolving linear separators over the spherically symmetric distribution that is resistant to a drift rate of O(ε/n), and another algorithm over the more general product normal distributions that resists a smaller drift rate. The above translation result can be also interpreted as one on the robustness of the notion of evolvability itself under changes of definition. As a second result in that direction we show that every evolution algorithm can be converted to a quasi-monotonic one that can evolve from any starting point without the performance ever dipping significantly below that of the starting point. This permits the somewhat unnatural feature of arbitrary performance degradations to be removed from several known robustness translations.

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

↑