arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.03229cs.LGstat.ML
收藏

基于一维子空间的高维自适应安全贝叶斯优化

Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces

ETH Zurich(苏黎世联邦理工学院);Paul Scherrer Institut(保罗·谢勒研究所)

Johannes Kirschner, Mojmír Mutný, Nicole Hiller, Rasmus Ischebeck, Andreas Krause

摘要:

已知贝叶斯优化难以扩展到高维,因为获取步骤需要在相同的搜索空间中求解非凸优化问题。为了扩展该方法并保持其优势,我们提出了一种算法(LineBO),该算法将问题限制为一系列迭代选择的一维子问题,可以有效地解决。我们表明,我们的算法全局收敛,并获得一个快速的局部速度时,函数是强凸的。此外,如果目标有一个不变的子空间,我们的方法自动适应有效的尺寸,而不改变算法。当与SafeOpt算法相结合来解决子问题时,我们获得了第一个安全的贝叶斯优化算法,该算法具有适用于高维设置的理论保证。我们在多个合成基准上评估我们的方法,在那里我们获得了有竞争力的性能。此外,我们部署我们的算法,以优化瑞士自由电子激光器的光束强度与多达40个参数,同时满足安全操作的限制。

英文摘要:

Bayesian optimization is known to be difficult to scale to high dimensions, because the acquisition step requires solving a non-convex optimization problem in the same search space. In order to scale the method and keep its benefits, we propose an algorithm (LineBO) that restricts the problem to a sequence of iteratively chosen one-dimensional sub-problems that can be solved efficiently. We show that our algorithm converges globally and obtains a fast local rate when the function is strongly convex. Further, if the objective has an invariant subspace, our method automatically adapts to the effective dimension without changing the algorithm. When combined with the SafeOpt algorithm to solve the sub-problems, we obtain the first safe Bayesian optimization algorithm with theoretical guarantees applicable in high-dimensional settings. We evaluate our method on multiple synthetic benchmarks, where we obtain competitive performance. Further, we deploy our algorithm to optimize the beam intensity of the Swiss Free Electron Laser with up to 40 parameters while satisfying safe operation constraints.

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

↑