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

COCOpf:一个算法组合框架

COCOpf: An Algorithm Portfolio Framework

Czech Technical University(捷克理工大学)

Petr Baudiš

摘要:

算法组合表示在单个通用求解器中组合多个启发式算法的策略,每个启发式算法适合于不同类别的问题,该通用求解器将为每个输入选择最适合的算法。这种方法最近获得了普及,特别是解决组合问题,但优化应用仍然是新兴的。BBOB workshop系列的COCO平台是目前衡量连续黑箱优化算法性能的标准方法。作为对COCO平台的扩展,我们提出了基于Python的COCOpf框架,该框架允许组合优化算法并使用不同的选择策略运行实验。在我们的框架中,我们专注于黑盒算法组合和在线自适应选择。作为演示,我们单独测量股票SciPy优化算法和流行的CMA算法的性能,并在具有两个简单选择策略的投资组合中进行测量。我们确认,即使是一个天真的选择策略可以提供更好的性能跨问题类。

英文摘要:

Algorithm portfolios represent a strategy of composing multiple heuristic algorithms, each suited to a different class of problems, within a single general solver that will choose the best suited algorithm for each input. This approach recently gained popularity especially for solving combinatoric problems, but optimization applications are still emerging. The COCO platform of the BBOB workshop series is the current standard way to measure performance of continuous black-box optimization algorithms. As an extension to the COCO platform, we present the Python-based COCOpf framework that allows composing portfolios of optimization algorithms and running experiments with different selection strategies. In our framework, we focus on black-box algorithm portfolio and online adaptive selection. As a demonstration, we measure the performance of stock SciPy optimization algorithms and the popular CMA algorithm alone and in a portfolio with two simple selection strategies. We confirm that even a naive selection strategy can provide improved performance across problem classes.

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

↑