arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.09682stat.MLcs.LG
收藏

多尺度高斯过程水平集估计

Multiscale Gaussian Process Level Set Estimation

University of California, San Diego(加利福尼亚大学圣地亚哥分校)

Shubhanshu Shekhar, Tara Javidi

摘要:

在本文中,黑盒函数的水平集估计的问题,考虑了噪声和昂贵的评估查询。提出了一种基于高斯过程(GP)先验的贝叶斯框架下的新算法。该算法采用了分层序列的分区,探索不同的区域的搜索空间在不同的细节水平,这取决于他们的接近水平集边界。结果表明,这种方法的结果,在算法具有低复杂度的实现,其计算成本是显着小于现有的算法为高维搜索空间$\X$。此外,高概率界的估计水平集和真实水平集之间的差异的测量所提出的算法,这是严格优于现有的保证一大类的GP。在这个过程中,一个更严格的表征所提出的算法的信息增益得到考虑到结构化的性质的评价点。该方法改进了现有的以最大信息增益来限制信息增益的技术。

英文摘要:

In this paper, the problem of estimating the level set of a black-box function from noisy and expensive evaluation queries is considered. A new algorithm for this problem in the Bayesian framework with a Gaussian Process (GP) prior is proposed. The proposed algorithm employs a hierarchical sequence of partitions to explore different regions of the search space at varying levels of detail depending upon their proximity to the level set boundary. It is shown that this approach results in the algorithm having a low complexity implementation whose computational cost is significantly smaller than the existing algorithms for higher dimensional search space $\X$. Furthermore, high probability bounds on a measure of discrepancy between the estimated level set and the true level set for the the proposed algorithm are obtained, which are shown to be strictly better than the existing guarantees for a large class of GPs. In the process, a tighter characterization of the information gain of the proposed algorithm is obtained which takes into account the structured nature of the evaluation points. This approach improves upon the existing technique of bounding the information gain with maximum information gain.

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

↑