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

样本和计算效率高的高维随机克立格法

Sample and Computationally Efficient Stochastic Kriging in High Dimensions

Liang Ding, Xiaowei Zhang

摘要:

随机克里格法已被广泛用于模拟元建模,以预测复杂的模拟模型的响应面。然而,它的使用仅限于设计空间是低维的情况,因为通常,样本复杂度(即,随机克里金法产生精确预测所需的设计点的数量)在设计空间的维度上呈指数增长。大样本量导致运行模拟模型的样本成本过高,并且由于需要反转大的协方差阵而导致严重的计算挑战。基于张量马尔可夫核和稀疏网格试验设计,我们开发了一种新的方法,显着地消除维数灾难。我们表明,所提出的方法的样本复杂性增长只有轻微的维度,即使在模型误指定。我们还开发了快速算法,计算随机克里格在其确切的形式,没有任何近似方案。我们通过大量的数值实验证明,我们的方法可以处理设计空间超过10,000维的问题,相对于实践中的典型替代方法,预测精度和计算效率都提高了几个数量级。

英文摘要:

Stochastic kriging has been widely employed for simulation metamodeling to predict the response surface of complex simulation models. However, its use is limited to cases where the design space is low-dimensional because, in general, the sample complexity (i.e., the number of design points required for stochastic kriging to produce an accurate prediction) grows exponentially in the dimensionality of the design space. The large sample size results in both a prohibitive sample cost for running the simulation model and a severe computational challenge due to the need to invert large covariance matrices. Based on tensor Markov kernels and sparse grid experimental designs, we develop a novel methodology that dramatically alleviates the curse of dimensionality. We show that the sample complexity of the proposed methodology grows only slightly in the dimensionality, even under model misspecification. We also develop fast algorithms that compute stochastic kriging in its exact form without any approximation schemes. We demonstrate via extensive numerical experiments that our methodology can handle problems with a design space of more than 10,000 dimensions, improving both prediction accuracy and computational efficiency by orders of magnitude relative to typical alternative methods in practice.

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

↑