arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.09264cs.LGstat.ML
收藏

通过变量选择实现计算高效的高维贝叶斯优化

Computationally Efficient High-Dimensional Bayesian Optimization via Variable Selection

Carnegie Mellon University(卡内基梅隆大学)

Yihang Shen, Carl Kingsford

AI总结:

针对高维贝叶斯优化计算耗时且对嵌入维度敏感的问题,提出一种利用变量选择的新方法,能自动学习轴对齐子空间且无需预设超参数,理论推导了计算复杂度与遗憾界,并在合成与真实问题上验证了有效性。

摘要:

贝叶斯优化(BO)是一种全局优化黑盒函数的方法。尽管BO已成功应用于许多场景,但开发能扩展至高维域函数的有效BO算法仍是一项挑战。用原始BO优化此类函数极其耗时。基于将高维空间嵌入低维空间思想的高维BO替代策略,对需预先指定的嵌入维度选择很敏感。我们开发了一种利用变量选择的新的计算高效的高维BO方法。我们的方法能自动学习轴对齐子空间,即包含选定变量的空间,无需任何预先指定的超参数。我们在理论上分析了算法的计算复杂度并推导了遗憾界。我们在数个合成与真实问题上实证展示了该方法的有效性。

英文摘要:

Bayesian Optimization (BO) is a method for globally optimizing black-box functions. While BO has been successfully applied to many scenarios, developing effective BO algorithms that scale to functions with high-dimensional domains is still a challenge. Optimizing such functions by vanilla BO is extremely time-consuming. Alternative strategies for high-dimensional BO that are based on the idea of embedding the high-dimensional space to the one with low dimension are sensitive to the choice of the embedding dimension, which needs to be pre-specified. We develop a new computationally efficient high-dimensional BO method that exploits variable selection. Our method is able to automatically learn axis-aligned sub-spaces, i.e. spaces containing selected variables, without the demand of any pre-specified hyperparameters. We theoretically analyze the computational complexity of our algorithm and derive the regret bound. We empirically show the efficacy of our method on several synthetic and real problems.

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

↑