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

更快地计算预期的超卷改进

Faster Computation of Expected Hypervolume Improvement

Iris Hupkens, Michael Emmerich, André Deutz

摘要:

期望改进算法(或高效全局优化)的目标是在黑盒函数评估的预算有限的情况下进行全局连续优化。它是基于从以前的评估和填充标准-预期的改善-用于找到一个有希望的点,一个新的评估学习的功能的统计模型。“预期改进”填充标准考虑到预测性多元高斯分布的均值和方差。期望改进算法最近被推广到多目标优化。为了定量地测量帕累托前沿的改善,使用了主导(超)量的增益。预期超体积改善(EHVI)的计算是一个多维积分的逐步定义的非线性函数相关的高斯概率密度函数的交叉框。本文提出了一种精确计算两个以上目标函数的期望改进的新算法。对于双准则情况,它具有$O(n^2)$的时间复杂度,其中$n$表示当前最佳帕累托前沿近似中的点的数量。它改进了以前已知的算法的时间复杂度$O(n^3 \log n)$。对于三准则优化,我们设计了一个时间复杂度为$O(n^3)$的算法。除了讨论新的时间复杂度界限,新算法的速度也进行了测试经验上的测试数据。结果表明,通过重用在以前的迭代中建立的数据结构,可以实现速度的进一步提高。所得到的数值算法可以很容易地使用在现有的实现超体积为基础的预期改进算法。

英文摘要:

The expected improvement algorithm (or efficient global optimization) aims for global continuous optimization with a limited budget of black-box function evaluations. It is based on a statistical model of the function learned from previous evaluations and an infill criterion - the expected improvement - used to find a promising point for a new evaluation. The `expected improvement' infill criterion takes into account the mean and variance of a predictive multivariate Gaussian distribution. The expected improvement algorithm has recently been generalized to multiobjective optimization. In order to measure the improvement of a Pareto front quantitatively the gain in dominated (hyper-)volume is used. The computation of the expected hypervolume improvement (EHVI) is a multidimensional integration of a step-wise defined non-linear function related to the Gaussian probability density function over an intersection of boxes. This paper provides a new algorithm for the exact computation of the expected improvement to more than two objective functions. For the bicriteria case it has a time complexity in $O(n^2)$ with $n$ denoting the number of points in the current best Pareto front approximation. It improves previously known algorithms with time complexity $O(n^3 \log n)$. For tricriteria optimization we devise an algorithm with time complexity of $O(n^3)$. Besides discussing the new time complexity bounds the speed of the new algorithm is also tested empirically on test data. It is shown that further improvements in speed can be achieved by reusing data structures built up in previous iterations. The resulting numerical algorithms can be readily used in existing implementations of hypervolume-based expected improvement algorithms.

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

↑