arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.07443cs.LGcs.ROcs.SYeess.SYstat.ML
收藏

有限故障预算下约束贝叶斯优化的偏移搜索

Excursion Search for Constrained Bayesian Optimization under a Limited Budget of Failures

Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);IAV GmbH(IAV有限公司);University of Cambridge(剑桥大学);RWTH Aachen University(亚琛工业大学)

Alonso Marco, Alexander von Rohr, Dominik Baumann, José Miguel Hernández-Lobato, Sebastian Trimpe

摘要:

在学习骑自行车时,一个孩子在第一次成功之前摔倒了很多次。由于摔倒通常只会产生轻微的后果,因此可以将其视为一种可容忍的失败,以换取更快的学习过程,因为它提供了有关不受欢迎行为的丰富信息。在未知约束下的贝叶斯优化(BOC)的背景下,典型的安全学习策略保守地探索,并尽一切努力避免失败。在频谱的另一侧,允许失败的非保守BOC算法在达到最优之前可能失败无限次。在这项工作中,我们提出了一种新的决策者接地控制理论,控制量的风险,我们允许在搜索作为一个给定的预算失败的函数。实证验证表明,我们的算法更有效地使用故障预算在各种优化实验,并普遍实现较低的遗憾,比国家的最先进的方法。此外,我们提出了一个原始的无约束贝叶斯优化算法的灵感来自随机过程中的偏移集的概念,基于故障感知算法的建立。

英文摘要:

When learning to ride a bike, a child falls down a number of times before achieving the first success. As falling down usually has only mild consequences, it can be seen as a tolerable failure in exchange for a faster learning process, as it provides rich information about an undesired behavior. In the context of Bayesian optimization under unknown constraints (BOC), typical strategies for safe learning explore conservatively and avoid failures by all means. On the other side of the spectrum, non conservative BOC algorithms that allow failing may fail an unbounded number of times before reaching the optimum. In this work, we propose a novel decision maker grounded in control theory that controls the amount of risk we allow in the search as a function of a given budget of failures. Empirical validation shows that our algorithm uses the failures budget more efficiently in a variety of optimization experiments, and generally achieves lower regret, than state-of-the-art methods. In addition, we propose an original algorithm for unconstrained Bayesian optimization inspired by the notion of excursion sets in stochastic processes, upon which the failures-aware algorithm is built.

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

↑