arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.07029cs.LGstat.ML
收藏

约束条件下多目标贝叶斯优化的不确定性搜索框架

Uncertainty aware Search Framework for Multi-Objective Bayesian Optimization with Constraints

Washington State University(华盛顿州立大学)

Syrine Belakaria, Aryan Deshwal, Janardhan Rao Doppa

摘要:

我们考虑约束多目标(MO)黑盒优化问题,使用昂贵的功能评估,其目标是近似的真正的Pareto集的解决方案,满足一组约束,同时最小化的功能评估的数量。我们提出了一个新的框架命名为不确定性感知搜索框架多目标优化约束(USeMOC),有效地选择输入序列进行评估,以解决这个问题。USeMOC的选择方法包括通过真函数的代理模型来确定最有希望的候选者并基于不确定性度量来挑选最佳候选者,从而解决廉价的约束MO优化问题。我们应用这个框架来优化设计的多输出开关电容电压调节器,通过昂贵的模拟。我们的实验结果表明,USeMOC是能够实现超过90%的数量减少所需的模拟发现优化的电路。

英文摘要:

We consider the problem of constrained multi-objective (MO) blackbox optimization using expensive function evaluations, where the goal is to approximate the true Pareto set of solutions satisfying a set of constraints while minimizing the number of function evaluations. We propose a novel framework named Uncertainty-aware Search framework for Multi-Objective Optimization with Constraints (USeMOC) to efficiently select the sequence of inputs for evaluation to solve this problem. The selection method of USeMOC consists of solving a cheap constrained MO optimization problem via surrogate models of the true functions to identify the most promising candidates and picking the best candidate based on a measure of uncertainty. We applied this framework to optimize the design of a multi-output switched-capacitor voltage regulator via expensive simulations. Our experimental results show that USeMOC is able to achieve more than 90 % reduction in the number of simulations needed to uncover optimized circuits.

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

↑