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

用于贝叶斯优化的 Voronoi 候选点

Voronoi Candidates for Bayesian Optimization

University of Massachusetts(马萨诸塞大学);Montana State University(蒙大拿州立大学);Virginia Tech(弗吉尼亚理工大学)

Nathan Wycoff, John W. Smith, Annie S. Booth, Robert B. Gramacy

AI总结:

本文提出在贝叶斯优化中使用 Voronoi 边界候选点,并通过直接采样避免显式剖分,在保持精度的同时显著降低高维采集优化耗时。

摘要:

贝叶斯优化(BO)为高效优化黑盒函数提供了一种优雅的方法。然而,采集准则需要进行其自身颇具挑战性的内部优化,这可能带来显著的开销。许多实用的 BO 方法,尤其是在高维情形下,会放弃对采集函数进行形式化的连续优化,转而在一组有限的空间填充候选点上进行离散搜索。在本文中,我们建议使用位于当前设计点的 Voronoi 剖分边界上的候选点,因此这些候选点与两个或更多设计点等距。我们讨论了通过直接采样 Voronoi 边界而不显式生成剖分来高效实现的策略,从而能够适应高维中的大型设计。在一系列通过 Gaussian processes 结合 expected improvement 进行优化的测试问题上,我们提出的方法显著缩短了多起点连续搜索的执行时间,且没有精度损失。

英文摘要:

Bayesian optimization (BO) offers an elegant approach for efficiently optimizing black-box functions. However, acquisition criteria demand their own challenging inner-optimization, which can induce significant overhead. Many practical BO methods, particularly in high dimension, eschew a formal, continuous optimization of the acquisition function and instead search discretely over a finite set of space-filling candidates. Here, we propose to use candidates which lie on the boundary of the Voronoi tessellation of the current design points, so they are equidistant to two or more of them. We discuss strategies for efficient implementation by directly sampling the Voronoi boundary without explicitly generating the tessellation, thus accommodating large designs in high dimension. On a battery of test problems optimized via Gaussian processes with expected improvement, our proposed approach significantly improves the execution time of a multi-start continuous search without a loss in accuracy.

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

↑