arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0610126cs.NEcs.LG
收藏

适应度均匀优化

Fitness Uniform Optimization

Marcus Hutter, Shane Legg

摘要:

在进化算法中,种群的适应度随着时间的推移而增加,通过变异和重组个体,并通过偏向选择更适合的个体。正确的选择压力是至关重要的,一方面,在确保充分的优化进展,并在保持遗传多样性,以便能够从局部最优的另一方面。受个体之间普遍的相似关系的启发,我们提出了一种新的选择方案,该方案在适应度值上是一致的。它产生的选择压力,对人口稀少的健身区,不一定对更高的健身,是所有其他选择方案的情况。我们分析了一个简单的例子,新的选择方案可以比标准的选择方案更有效。我们还提出了一个新的删除方案,通过删除实现了类似的结果,并显示这样的计划如何更有效地保留遗传多样性比标准的方法。我们比较了新方案的性能,比赛选择和随机删除的人工欺骗问题和一系列的NP-困难的问题:旅行商,集覆盖和可满足性。

英文摘要:

In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. The right selection pressure is critical in ensuring sufficient optimization progress on the one hand and in preserving genetic diversity to be able to escape from local optima on the other hand. Motivated by a universal similarity relation on the individuals, we propose a new selection scheme, which is uniform in the fitness values. It generates selection pressure toward sparsely populated fitness regions, not necessarily toward higher fitness, as is the case for all other selection schemes. We show analytically on a simple example that the new selection scheme can be much more effective than standard selection schemes. We also propose a new deletion scheme which achieves a similar result via deletion and show how such a scheme preserves genetic diversity more effectively than standard approaches. We compare the performance of the new schemes to tournament selection and random deletion on an artificial deceptive problem and a range of NP-hard problems: traveling salesman, set covering and satisfiability.

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

↑