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

局部高斯过程预测中邻域搜索的加速

Speeding up neighborhood search in local Gaussian process prediction

Robert B. Gramacy, Benjamin Haaland

摘要:

局部近似高斯过程模型的最新实现推动了非线性、非参数预测问题的计算边界,特别是当部署为计算机实验的仿真器时。他们的空间独立计算风格适应大规模并行化,这意味着他们可以处理比以前大两个或更多数量级的设计。然而,完成这一壮举仍然需要大量的超级计算资源。我们的目标是减轻这一负担。我们研究如何预测方差减少本地设计建立预测。然后,我们观察到如何详尽和离散的性质,一个重要的搜索子程序参与建设这样的本地设计可能过于保守。相反,我们建议径向搜索空间,即,沿着从感兴趣的预测位置发出的射线连续地发射,是一种更加节约的替代方案。我们的实证工作表明,基于射线的搜索产生预测的准确性相媲美的穷举搜索,但在一小部分的时间-使超级计算机实现回到桌面上。

英文摘要:

Recent implementations of local approximate Gaussian process models have pushed computational boundaries for non-linear, non-parametric prediction problems, particularly when deployed as emulators for computer experiments. Their flavor of spatially independent computation accommodates massive parallelization, meaning that they can handle designs two or more orders of magnitude larger than previously. However, accomplishing that feat can still require massive supercomputing resources. Here we aim to ease that burden. We study how predictive variance is reduced as local designs are built up for prediction. We then observe how the exhaustive and discrete nature of an important search subroutine involved in building such local designs may be overly conservative. Rather, we suggest that searching the space radially, i.e., continuously along rays emanating from the predictive location of interest, is a far thriftier alternative. Our empirical work demonstrates that ray-based search yields predictors with accuracy comparable to exhaustive search, but in a fraction of the time - bringing a supercomputer implementation back onto the desktop.

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

↑