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

面向贝叶斯优化的鲁棒期望改进

Robust expected improvement for Bayesian optimization

NORC at the University of Chicago(芝加哥大学NORC研究中心);University of Chicago(芝加哥大学);Virginia Tech(弗吉尼亚理工大学)

Ryan B. Christianson, Robert B. Gramacy

AI总结:

针对贝叶斯优化中期望改进难以获得宽吸引域鲁棒最优解的问题,提出融合对抗目标的鲁棒期望改进方法,并在合成与真实任务上验证比较。

摘要:

贝叶斯优化(BO)将高斯过程(GP)代理模型与序贯设计相结合,以优化评估代价高昂的黑箱函数。示例性的设计启发式方法,即所谓的采集函数,如期望改进(EI),会平衡探索与利用,从而在严格的评估预算下提供全局解。然而,它们在求解鲁棒最优解时存在不足,这里的鲁棒最优解是指更偏好处于更宽吸引域内的解。当输入设定不精确,或者需要一系列解时,鲁棒解非常有用。在此类情形中,一种常见的数学规划技术涉及对抗性目标,它会使局部求解器偏离“尖锐”的低谷。本文提出一种名为鲁棒期望改进(REI)的代理建模与主动学习技术,将对抗性方法移植到 BO/GP 框架中。在描述这些方法之后,我们在不同复杂度的基准合成练习和真实问题上进行了说明,并与若干竞争方法进行了比较。

英文摘要:

Bayesian Optimization (BO) links Gaussian Process (GP) surrogates with sequential design toward optimizing expensive-to-evaluate black-box functions. Example design heuristics, or so-called acquisition functions, like expected improvement (EI), balance exploration and exploitation to furnish global solutions under stringent evaluation budgets. However, they fall short when solving for robust optima, meaning a preference for solutions in a wider domain of attraction. Robust solutions are useful when inputs are imprecisely specified, or where a series of solutions is desired. A common mathematical programming technique in such settings involves an adversarial objective, biasing a local solver away from ``sharp'' troughs. Here we propose a surrogate modeling and active learning technique called robust expected improvement (REI) that ports adversarial methodology into the BO/GP framework. After describing the methods, we illustrate and draw comparisons to several competitors on benchmark synthetic exercises and real problems of varying complexity.

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

↑