arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0711.1401cs.NEcs.AI
收藏

简单遗传算法的自适应理论

Towards a Sound Theory of Adaptation for the Simple Genetic Algorithm

Brandeis University(布兰迪斯大学)

Keki Burjorjee

摘要:

演化计算和机器学习领域的进展速度目前是有限的-在前一个领域,不可能作出有利的扩展进化算法时,他们的适应能力知之甚少,在后者的困难,找到有效的半原则性减少困难的现实世界的问题相对简单的优化问题。在本文中,我们解释了为什么一个理论,它可以准确地解释简单的遗传算法的显着的适应能力有可能解决这两个局限性。我们描述了我们认为是障碍-历史和分析-发现这样一个理论,并强调的负面作用,积木假说(BBH)发挥。我们认为,实验结果的基础上,一个基本的限制,这被广泛认为是限制SGA的自适应能力(并强烈暗示的BBH),实际上是虚幻的,并不存在。因此,SGA比目前认为的更强大。我们给出的条件下,它成为可行的数值近似和研究的多元边际的搜索分布的一个无限的人口SGA在多个世代,即使当它的基因组很长,并解释为什么这种分析是相关的谜语的SGA的显着的自适应能力。

英文摘要:

The pace of progress in the fields of Evolutionary Computation and Machine Learning is currently limited -- in the former field, by the improbability of making advantageous extensions to evolutionary algorithms when their capacity for adaptation is poorly understood, and in the latter by the difficulty of finding effective semi-principled reductions of hard real-world problems to relatively simple optimization problems. In this paper we explain why a theory which can accurately explain the simple genetic algorithm's remarkable capacity for adaptation has the potential to address both these limitations. We describe what we believe to be the impediments -- historic and analytic -- to the discovery of such a theory and highlight the negative role that the building block hypothesis (BBH) has played. We argue based on experimental results that a fundamental limitation which is widely believed to constrain the SGA's adaptive ability (and is strongly implied by the BBH) is in fact illusionary and does not exist. The SGA therefore turns out to be more powerful than it is currently thought to be. We give conditions under which it becomes feasible to numerically approximate and study the multivariate marginals of the search distribution of an infinite population SGA over multiple generations even when its genomes are long, and explain why this analysis is relevant to the riddle of the SGA's remarkable adaptive abilities.

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

↑