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

降低计算复杂度的Kriging近似算法

Cluster-based Kriging Approximation Algorithms for Complexity Reduction

Leiden Institute of Advanced Computer Science(莱顿高级计算机科学研究所)

Bas van Stein, Hao Wang, Wojtek Kowalczyk, Michael Emmerich, Thomas Bäck

摘要:

克立格法或高斯过程回归作为一种非线性回归模型以及演化计算领域的代理模型在许多领域得到了应用。然而,随着数据量的不断增加,Kriging方法的计算复杂度和空间复杂度(数据点个数分别为三次方和二次方)成为其主要瓶颈。在本文中,我们提出了一种通用的方法来降低复杂性,称为集群克里格,其中整个数据集被划分为较小的集群和多个克里格模型建立在它们之上。此外,提出了四种克里金近似算法作为新框架内的候选算法。这些算法中的每一种都可以应用于更大的数据集,同时保持克里金的优势和功能。所提出的算法进行了详细的解释和经验比较,对一个广泛的现有国家的最先进的克里格近似方法的一个定义良好的测试框架。实验结果表明,所提算法的性能优于现有算法.最后,对算法的应用提出了一些建议.

英文摘要:

Kriging or Gaussian Process Regression is applied in many fields as a non-linear regression model as well as a surrogate model in the field of evolutionary computation. However, the computational and space complexity of Kriging, that is cubic and quadratic in the number of data points respectively, becomes a major bottleneck with more and more data available nowadays. In this paper, we propose a general methodology for the complexity reduction, called cluster Kriging, where the whole data set is partitioned into smaller clusters and multiple Kriging models are built on top of them. In addition, four Kriging approximation algorithms are proposed as candidate algorithms within the new framework. Each of these algorithms can be applied to much larger data sets while maintaining the advantages and power of Kriging. The proposed algorithms are explained in detail and compared empirically against a broad set of existing state-of-the-art Kriging approximation methods on a well-defined testing framework. According to the empirical study, the proposed algorithms consistently outperform the existing algorithms. Moreover, some practical suggestions are provided for using the proposed algorithms.

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

↑