arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.03300math.OCstat.ML
收藏

变尺寸设计空间问题的贝叶斯optimization

Bayesian optimization of variable-size design space problems

Julien Pelamatti, Loic Brevault, Mathieu Balesdent, El-Ghazali Talbi, Yannick Guerin

摘要:

在复杂系统设计框架内,经常需要求解混合变量最优化问题,其中目标函数和约束函数可以同时依赖于连续变量和离散变量。此外,复杂的系统设计问题偶尔会出现可变大小的设计空间。这导致最优化问题,其中搜索空间作为特定离散决策变量的值的函数沿着优化过程动态地变化(关于变量的数量和类型)。类似地,约束的数量和类型也可以变化。在本文中,两种替代贝叶斯优化的方法,提出了解决这类最优化问题。第一个是预算分配策略,允许将计算预算集中在最有前途的设计子空间上。相反,第二种方法是基于核函数的定义,允许计算由部分不同的变量集表征的样本之间的协方差。分析和工程相关的测试情况下得到的结果表明,这两种方法的标准方法更快,更一致的收敛。

英文摘要:

Within the framework of complex system design, it is often necessary to solve mixed variable optimization problems, in which the objective and constraint functions can depend simultaneously on continuous and discrete variables. Additionally, complex system design problems occasionally present a variable-size design space. This results in an optimization problem for which the search space varies dynamically (with respect to both number and type of variables) along the optimization process as a function of the values of specific discrete decision variables. Similarly, the number and type of constraints can vary as well. In this paper, two alternative Bayesian Optimization-based approaches are proposed in order to solve this type of optimization problems. The first one consists in a budget allocation strategy allowing to focus the computational budget on the most promising design sub-spaces. The second approach, instead, is based on the definition of a kernel function allowing to compute the covariance between samples characterized by partially different sets of variables. The results obtained on analytical and engineering related test-cases show a faster and more consistent convergence of both proposed methods with respect to the standard approaches.

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

↑