论文标题

在不确定性下贝叶斯优化中的耦合和选择约束

Coupling and selecting constraints in Bayesian optimization under uncertainties

论文作者

Pelamatti, Julien, Riche, Rodolphe Le, Helbert, Céline, Blanchet-Scalliet, Christophette

论文摘要

我们考虑频率受到限制的优化,在遵守约束时,它试图优化函数,这两者都受到不确定性的影响。现实模拟的高计算成本强烈限制了评估的数量,并使这种类型的问题特别具有挑战性。在这种情况下,通常依靠贝叶斯优化算法。假设不丧失一般性,不确定性来自某些输入,则可以在设计和不确定变量的关节空间中构建高斯过程模型。然后使用两步采集函数来提供与相关不确定样本相关的有希望的优化变量。我们的总体贡献是将GP模型中的约束相关联,并利用这一点,以最佳地确定每次迭代,应评估哪些约束以及在此点。约束的耦合高斯模型依赖于输入的编码。通过使每个约束可以评估不同的不确定输入,从而提高了完善效率,可以开发约束选择思想。约束耦合和选择逐渐在3种算法变体中实现,这些变体与参考贝叶斯方法进行了比较。在2,4和27维问题上观察到的收敛速度,准确性和稳定性方面,结果是有希望的。

We consider chance constrained optimization where it is sought to optimize a function while complying with constraints, both of which are affected by uncertainties. The high computational cost of realistic simulations strongly limits the number of evaluations and makes this type of problems particularly challenging. In such a context, it is common to rely on Bayesian optimization algorithms. Assuming, without loss of generality, that the uncertainty comes from some of the inputs, it becomes possible to build a Gaussian process model in the joint space of design and uncertain variables. A two-step acquisition function is then used to provide, both, promising optimization variables associated to relevant uncertain samples. Our overall contribution is to correlate the constraints in the GP model and exploit this to optimally decide, at each iteration, which constraint should be evaluated and at which point. The coupled Gaussian model of the constraints relies on an output-as-input encoding. The constraint selection idea is developed by enabling that each constraint can be evaluated for a different uncertain input, thus improving the refinement efficiency. Constraints coupling and selection are gradually implement in 3 algorithm variants which are compared to a reference Bayesian approach. The results are promising in terms of convergence speed, accuracy and stability as observed on a 2, a 4 and a 27-dimensional problems.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源