arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.05899cs.NE
收藏

模块化CMA-ES的顺序算法选择和配置与集成算法选择和配置的比较

Sequential vs. Integrated Algorithm Selection and Configuration: A Case Study for the Modular CMA-ES

Diederick Vermetten, Hao Wang, Carola Doerr, Thomas Bäck

摘要:

当面对特定的优化问题时,选择使用哪种算法总是一项艰巨的任务。不仅有各种各样的算法可供选择,而且这些算法通常由许多超参数控制,这些超参数需要调整以实现最佳性能。通常,这个问题分为两个部分:算法选择和算法配置。然而,随着机器学习取得的重大进展,这些问题可以集成到组合算法选择和超参数优化任务中,通常称为CASH问题。在这项工作中,我们比较顺序和集成的算法选择和配置方法的情况下,选择和调整最好的协方差矩阵自适应演化策略(CMA-ES)的黑箱优化基准测试(BBOB)套件的4608个变种。我们首先表明,模块化CMA-ES变体的排名在很大程度上取决于超参数的质量。这意味着即使是基于算法空间的完全枚举的顺序方法也可能导致次优解决方案。事实上,我们表明,集成的方法管理,以更小的计算成本提供有竞争力的结果。我们还比较了两种不同的混合整数算法配置技术,称为Irace和混合整数并行高效全局优化(MIP-EGO)。虽然我们表明,这两种方法在处理勘探开发平衡方面存在显着差异,但它们的整体表现非常相似。

英文摘要:

When faced with a specific optimization problem, choosing which algorithm to use is always a tough task. Not only is there a vast variety of algorithms to select from, but these algorithms often are controlled by many hyperparameters, which need to be tuned in order to achieve the best performance possible. Usually, this problem is separated into two parts: algorithm selection and algorithm configuration. With the significant advances made in Machine Learning, however, these problems can be integrated into a combined algorithm selection and hyperparameter optimization task, commonly known as the CASH problem. In this work we compare sequential and integrated algorithm selection and configuration approaches for the case of selecting and tuning the best out of 4608 variants of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) tested on the Black Box Optimization Benchmark (BBOB) suite. We first show that the ranking of the modular CMA-ES variants depends to a large extent on the quality of the hyperparameters. This implies that even a sequential approach based on complete enumeration of the algorithm space will likely result in sub-optimal solutions. In fact, we show that the integrated approach manages to provide competitive results at a much smaller computational cost. We also compare two different mixed-integer algorithm configuration techniques, called irace and Mixed-Integer Parallel Efficient Global Optimization (MIP-EGO). While we show that the two methods differ significantly in their treatment of the exploration-exploitation balance, their overall performances are very similar.

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

↑