PI回来了!贝叶斯优化中捕获函数的切换
PI is back! Switching Acquisition Functions in Bayesian Optimization
摘要:
贝叶斯优化(BO)是一种强大的,样本效率高的技术,用于优化评估成本高的函数。每个BO组件,如代理模型、采集功能(AF)或初始设计,都有广泛的设计选择。为给定的优化任务选择正确的组件是一项具有挑战性的任务,这可能对所获得的结果的质量产生重大影响。在这项工作中,我们开始分析哪些AF有利于哪些优化方案。为此,我们使用预期改进(EI)和改进概率(PI)作为COCO环境的24个BBOB函数的采集函数对SMAC 3进行基准测试。我们比较他们的结果与AF之间切换的时间表。一种调度的目标是在早期优化步骤中使用EI的探索行为,然后在最后步骤中切换到PI以获得更好的利用。我们还比较了随机时间表和循环选择EI和PI。我们观察到,动态调度往往优于任何单一的静态。我们的研究结果表明,分配前25%的优化预算EI和PI的最后75%的时间表是一个可靠的默认值。然而,我们也观察到24个函数的相当大的性能差异,这表明每个实例的分配,可能是动态学习的,可以提供比最先进的BO设计显着的改进。
英文摘要:
Bayesian Optimization (BO) is a powerful, sample-efficient technique to optimize expensive-to-evaluate functions. Each of the BO components, such as the surrogate model, the acquisition function (AF), or the initial design, is subject to a wide range of design choices. Selecting the right components for a given optimization task is a challenging task, which can have significant impact on the quality of the obtained results. In this work, we initiate the analysis of which AF to favor for which optimization scenarios. To this end, we benchmark SMAC3 using Expected Improvement (EI) and Probability of Improvement (PI) as acquisition functions on the 24 BBOB functions of the COCO environment. We compare their results with those of schedules switching between AFs. One schedule aims to use EI's explorative behavior in the early optimization steps, and then switches to PI for a better exploitation in the final steps. We also compare this to a random schedule and round-robin selection of EI and PI. We observe that dynamic schedules oftentimes outperform any single static one. Our results suggest that a schedule that allocates the first 25 % of the optimization budget to EI and the last 75 % to PI is a reliable default. However, we also observe considerable performance differences for the 24 functions, suggesting that a per-instance allocation, possibly learned on the fly, could offer significant improvement over the state-of-the-art BO designs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。