arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.13046math.OCcs.NE
收藏

面向点集的离散与混合变量优化的CMA-ES

CMA-ES for Discrete and Mixed-Variable Optimization on Sets of Points

Kento Uchida, Ryoki Hamano, Masahiro Nomura, Shota Saito, Shinichi Shirakawa

AI总结:

本文针对点集上的离散与混合变量优化问题,提出了CMA-ES-SoP方法,通过引入边缘校正机制防止过早收敛并自适应更新目标边缘值,成功解决了朴素CMA-ES因早熟收敛而失效的问题。

摘要:

离散和混合变量优化问题已出现在多个现实应用中。大多数关于混合变量优化的研究考虑了整数和连续变量的混合,并开发了多种整数处理方法,以将连续优化方法的优化性能继承到混合整数优化中。在某些应用中,可接受的解是通过在不相交的子空间中选择可能的点来给出的。本文专注于点集上的优化,提出了一种通过扩展协方差矩阵自适应进化策略(CMA-ES)的优化方法,称为点集上的CMA-ES(CMA-ES-SoP)。CMA-ES-SoP结合了边缘校正机制,该机制维持相邻点的生成概率,以防止过早收敛到特定的非最优点,这是CMA-ES的一种有效整数处理技术。此外,由于具有固定边缘值的边缘校正往往会使部分相邻点的边缘概率增加过多,CMA-ES-SoP自适应地更新目标边缘值,使边缘概率的平均值接近预定的目标概率。数值模拟表明,CMA-ES-SoP成功优化了点集上的优化问题,而朴素的CMA-ES由于过早收敛未能对其进行优化。

英文摘要:

Discrete and mixed-variable optimization problems have appeared in several real-world applications. Most of the research on mixed-variable optimization considers a mixture of integer and continuous variables, and several integer handlings have been developed to inherit the optimization performance of the continuous optimization methods to mixed-integer optimization. In some applications, acceptable solutions are given by selecting possible points in the disjoint subspaces. This paper focuses on the optimization on sets of points and proposes an optimization method by extending the covariance matrix adaptation evolution strategy (CMA-ES), termed the CMA-ES on sets of points (CMA-ES-SoP). The CMA-ES-SoP incorporates margin correction that maintains the generation probability of neighboring points to prevent premature convergence to a specific non-optimal point, which is an effective integer-handling technique for CMA-ES. In addition, because margin correction with a fixed margin value tends to increase the marginal probabilities for a portion of neighboring points more than necessary, the CMA-ES-SoP updates the target margin value adaptively to make the average of the marginal probabilities close to a predefined target probability. Numerical simulations demonstrated that the CMA-ES-SoP successfully optimized the optimization problems on sets of points, whereas the naive CMA-ES failed to optimize them due to premature convergence.

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

↑