arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.13482cs.NEmath.OC
收藏

带边际的CMA-ES:混合随机黑箱优化的下界边际概率

CMA-ES with Margin: Lower-Bounding Marginal Probability for Mixed-Integer Black-Box Optimization

Ryoki Hamano, Shota Saito, Masahiro Nomura, Shinichi Shirakawa

摘要:

本研究针对混合整数黑箱最佳化(MI-BBO)问题,其中连续变数与整数变数应同时最佳化。我们在这项研究中的重点是CMA-ES,是一种基于种群的随机搜索方法,该方法从多元高斯分布(MGD)中抽取候选解,在连续BBO中表现出优异的性能。MGD的参数,平均值和(协)方差,更新的基础上的候选解决方案在CMA-ES的评价值。然而,如果将CMA-ES应用于直接离散化的MI-BBO,则在达到最优解之前,整数变量对应的方差变得比离散化的粒度小得多,这导致优化的停滞。特别是,当问题中包含二进制变量时,这种停滞更有可能发生,因为离散化的粒度变得更宽,并且对CMA-ES的现有修改没有解决这种停滞。为了克服这些限制,我们提出了一种简单的CMA-ES修改,该修改基于对与MGD中整数变量生成相关的边缘概率进行下界。MI-BBO基准问题的数值实验表明了该方法的有效性和鲁棒性。

英文摘要:

This study targets the mixed-integer black-box optimization (MI-BBO) problem where continuous and integer variables should be optimized simultaneously. The CMA-ES, our focus in this study, is a population-based stochastic search method that samples solution candidates from a multivariate Gaussian distribution (MGD), which shows excellent performance in continuous BBO. The parameters of MGD, mean and (co)variance, are updated based on the evaluation value of candidate solutions in the CMA-ES. If the CMA-ES is applied to the MI-BBO with straightforward discretization, however, the variance corresponding to the integer variables becomes much smaller than the granularity of the discretization before reaching the optimal solution, which leads to the stagnation of the optimization. In particular, when binary variables are included in the problem, this stagnation more likely occurs because the granularity of the discretization becomes wider, and the existing modification to the CMA-ES does not address this stagnation. To overcome these limitations, we propose a simple modification of the CMA-ES based on lower-bounding the marginal probabilities associated with the generation of integer variables in the MGD. The numerical experiments on the MI-BBO benchmark problems demonstrate the efficiency and robustness of the proposed method.

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

↑