双变量分布估计算法可找到指数级数量的最优解
Bivariate Estimation-of-Distribution Algorithms Can Find an Exponential Number of Optima
AI总结:
针对多模态优化中经典进化算法难寻大量最优解的问题,提出测试函数EBOM,证明双变量EDA可快速生成能以均等最大概率采样指数级最优解的模型,且单变量模型无法实现该特性。
摘要:
在多模态优化场景中找到大量最优解是一项具有挑战性的任务。经典的基于种群的进化算法通常仅收敛到单个解。尽管可以通过应用小生境策略来抵消这一问题,但最优解的数量显然仍受种群规模的限制。分布估计算法(Estimation-of-Distribution Algorithms, EDAs)是一种替代方案,它维护解空间的概率模型而非种群。这类模型能够隐式表示远大于任何实际种群规模的解集。\n 为支持研究优化算法如何处理大量最优解,我们提出了测试函数EqualBlocksOneMax(EBOM)。它具有包含指数级数量最优解的简单适应度场景。我们证明,双变量EDA即互信息最大化输入聚类(mutual-information-maximizing input clustering),在无需任何问题特定修改的情况下,能快速生成一个与EBOM的理论理想模型表现高度相似的模型,该模型以相同的最大概率对指数级数量的每个最优解进行采样。我们还通过数学方法证明,没有任何单变量模型能接近具备这一特性:如果采样到一个最优解的概率至少为逆多项式级,则存在一个对数半径的汉明球,使得每个采样点以高概率位于该球内。
英文摘要:
Finding a large set of optima in a multimodal optimization landscape is a challenging task. Classical population-based evolutionary algorithms typically converge only to a single solution. While this can be counteracted by applying niching strategies, the number of optima is nonetheless trivially bounded by the population size. Estimation-of-distribution algorithms (EDAs) are an alternative, maintaining a probabilistic model of the solution space instead of a population. Such a model is able to implicitly represent a solution set far larger than any realistic population size. To support the study of how optimization algorithms handle large sets of optima, we propose the test function EqualBlocksOneMax (EBOM). It has an easy fitness landscape with exponentially many optima. We show that the bivariate EDA mutual-information-maximizing input clustering, without any problem-specific modification, quickly generates a model that behaves very similarly to a theoretically ideal model for EBOM, which samples each of the exponentially many optima with the same maximal probability. We also prove via mathematical means that no univariate model can come close to having this property: If the probability to sample an optimum is at least inverse-polynomial, there is a Hamming ball of logarithmic radius such that, with high probability, each sample is in this ball.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。