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

连续优化分布的尺度估计算法

Scaling Up Estimation of Distribution Algorithms For Continuous Optimization

IBM Research - China(IBM中国研究院);Institute of Automation, Chinese Academy of Sciences(中国科学院自动化研究所);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);The University of Birmingham(伯明翰大学)

Weishan Dong, Tianshi Chen, Peter Tino, Xin Yao

摘要:

自分布估计算法(EDA)提出以来,人们在全局优化的背景下进行了许多尝试来提高EDA的性能。迄今为止,基于多元概率模型的连续EDAs的研究和应用仍然局限于较低维(小于100维)的问题。由于维数灾难和计算量的急剧增加,传统的EDA算法在解决高维问题时存在困难。然而,对于高维优化,仍然需要放大连续EDA,这得到了EDA的独特特征的支持:因为概率模型是显式估计的,所以可以从学习的模型中发现问题的有用属性或特征。除了获得一个好的解决方案,理解问题的结构可以有很大的好处,特别是对于黑盒优化。我们提出了一种新的EDA框架与模型复杂性控制(EDA-MCC),以扩大EDA。通过使用弱因变量识别(WI)和子空间建模(SM),EDA-MCC显示出显着优于传统的EDA高维问题的性能。此外,EDA-MCC的计算成本和大的人口规模的要求,可以减少。除了能够找到一个很好的解决方案,EDA-MCC还可以产生一个有用的问题结构表征。EDA-MCC是基于多变量模型的EDA的第一个成功实例,可以有效地应用于多达500 D的一般类问题。它也优于一些新开发的算法,专门为大规模优化设计。为了了解EDA-MCC的优点和缺点,我们进行了广泛的计算研究的EDA-MCC。我们的结果揭示了EDA-MCC在什么样的基准函数上可能优于其他函数。

英文摘要:

Since Estimation of Distribution Algorithms (EDA) were proposed, many attempts have been made to improve EDAs' performance in the context of global optimization. So far, the studies or applications of multivariate probabilistic model based continuous EDAs are still restricted to rather low dimensional problems (smaller than 100D). Traditional EDAs have difficulties in solving higher dimensional problems because of the curse of dimensionality and their rapidly increasing computational cost. However, scaling up continuous EDAs for higher dimensional optimization is still necessary, which is supported by the distinctive feature of EDAs: Because a probabilistic model is explicitly estimated, from the learnt model one can discover useful properties or features of the problem. Besides obtaining a good solution, understanding of the problem structure can be of great benefit, especially for black box optimization. We propose a novel EDA framework with Model Complexity Control (EDA-MCC) to scale up EDAs. By using Weakly dependent variable Identification (WI) and Subspace Modeling (SM), EDA-MCC shows significantly better performance than traditional EDAs on high dimensional problems. Moreover, the computational cost and the requirement of large population sizes can be reduced in EDA-MCC. In addition to being able to find a good solution, EDA-MCC can also produce a useful problem structure characterization. EDA-MCC is the first successful instance of multivariate model based EDAs that can be effectively applied a general class of up to 500D problems. It also outperforms some newly developed algorithms designed specifically for large scale optimization. In order to understand the strength and weakness of EDA-MCC, we have carried out extensive computational studies of EDA-MCC. Our results have revealed when EDA-MCC is likely to outperform others on what kind of benchmark functions.

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

↑