仿真
瓶颈
高斯过程
计算机科学
计算
过程(计算)
算法
高斯分布
差异(会计)
克里金
还原(数学)
数学优化
数学
机器学习
量子力学
经济增长
操作系统
物理
会计
业务
嵌入式系统
经济
几何学
作者
Benjamin Haaland,Chih‐Li Sung,Robert B. Gramacy
出处
期刊:Statistica Sinica
[Statistica Sinica (Institute of Statistical Science)]
日期:2017-04-18
被引量:7
标识
DOI:10.5705/ss.202016.0138
摘要
Gaussian process models are commonly used as emulators for computer experiments. However, developing a Gaussian process emulator can be computationally prohibitive when the number of experimental samples is even moderately large. Local Gaussian process approximation (Gramacy and Apley, 2015) was proposed as an accurate and computationally feasible emulation alternative. However, constructing local sub-designs specific to predictions at a particular location of interest remains a substantial computational bottleneck to the technique. In this paper, two computationally efficient neighborhood search limiting techniques are proposed, a maximum distance method and a feature approximation method. Two examples demonstrate that the proposed methods indeed save substantial computation while retaining emulation accuracy.
科研通智能强力驱动
Strongly Powered by AbleSci AI