约束优化问题中MAP-精英的评价
Evaluating MAP-Elites on Constrained Optimization Problems
摘要:
约束优化问题的特点往往是多个约束,在实践中,必须满足不同的公差水平。虽然一些约束是硬的,因此必须满足零容忍,但其他约束可能是软的,使得非零违规是可接受的。在这里,我们评估的适用性MAP-精英“照亮”约束搜索空间映射到特征空间,每个功能对应于一个不同的约束。一方面,MAP-Elites隐式地保留多样性,从而允许对搜索空间的良好探索。另一方面,它提供了一个有效的可视化,便于更好地理解约束违反如何与目标函数相关。我们证明了这种方法的可行性,在一个大的基准问题,在不同的维度,并与不同的算法配置。正如预期的那样,数值结果表明,一个基本版本的MAP-Elites不能竞争的所有问题(特别是那些与等式约束)与国家的最先进的算法,使用梯度信息或先进的约束处理技术。然而,它在发现约束违反与目标权衡并提供新的问题信息方面具有更高的潜力。因此,它可以在未来作为一个有效的积木设计新的约束优化算法。
英文摘要:
Constrained optimization problems are often characterized by multiple constraints that, in the practice, must be satisfied with different tolerance levels. While some constraints are hard and as such must be satisfied with zero-tolerance, others may be soft, such that non-zero violations are acceptable. Here, we evaluate the applicability of MAP-Elites to "illuminate" constrained search spaces by mapping them into feature spaces where each feature corresponds to a different constraint. On the one hand, MAP-Elites implicitly preserves diversity, thus allowing a good exploration of the search space. On the other hand, it provides an effective visualization that facilitates a better understanding of how constraint violations correlate with the objective function. We demonstrate the feasibility of this approach on a large set of benchmark problems, in various dimensionalities, and with different algorithmic configurations. As expected, numerical results show that a basic version of MAP-Elites cannot compete on all problems (especially those with equality constraints) with state-of-the-art algorithms that use gradient information or advanced constraint handling techniques. Nevertheless, it has a higher potential at finding constraint violations vs. objectives trade-offs and providing new problem information. As such, it could be used in the future as an effective building-block for designing new constrained optimization algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。