arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0383stat.MEstat.CO
收藏

大型计算机实验的局部高斯过程逼近

Local Gaussian process approximation for large computer experiments

Robert B. Gramacy, Daniel W. Apley

摘要:

我们提供了一种新的方法来近似仿真大型计算机实验。通过专注于明确的预期性能的预测方程,我们推导出一个家庭的本地顺序设计方案,动态定义的支持的高斯过程预测的基础上的本地子集的数据。我们进一步推导出表达式的快速顺序更新的所有需要的数量的本地设计迭代建立。然后,我们展示了如何独立的应用程序,我们的本地设计策略,在一个庞大的预测网格的元素,促进了平凡的并行实现。最终的结果是一个全局预测器,能够利用现代多核架构,同时允许非平稳建模功能作为奖励。我们展示了我们的方法上的两个例子,利用设计大小在数千,数万个数据点。比较的方法,companies支持的协方差。

英文摘要:

We provide a new approach to approximate emulation of large computer experiments. By focusing expressly on desirable properties of the predictive equations, we derive a family of local sequential design schemes that dynamically define the support of a Gaussian process predictor based on a local subset of the data. We further derive expressions for fast sequential updating of all needed quantities as the local designs are built-up iteratively. Then we show how independent application of our local design strategy across the elements of a vast predictive grid facilitates a trivially parallel implementation. The end result is a global predictor able to take advantage of modern multicore architectures, while at the same time allowing for a nonstationary modeling feature as a bonus. We demonstrate our method on two examples utilizing designs sized in the thousands, and tens of thousands of data points. Comparisons are made to the method of compactly supported covariances.

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

↑