论文标题
交流频段：一种基于组合匪徒的算法配置方法
AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration
论文作者
论文摘要
我们研究算法配置（AC）问题，其中人们试图以自动化的方式找到给定目标算法的最佳参数配置。最近，设计满足强大理论保证的AC方法方面取得了重大进展。但是，这些方法的实际表现与最先进的启发式方法之间仍然存在很大的差距。为此，我们介绍了AC波段，AC频段是基于多军匪徒的AC问题的一般方法，在表现出强大的实践表现的同时，提供了理论保证。我们表明，与提供理论保证的其他AC方法相比，AC频段所需的计算时间要少得多，同时仍产生高质量的配置。
We study the algorithm configuration (AC) problem, in which one seeks to find an optimal parameter configuration of a given target algorithm in an automated way. Recently, there has been significant progress in designing AC approaches that satisfy strong theoretical guarantees. However, a significant gap still remains between the practical performance of these approaches and state-of-the-art heuristic methods. To this end, we introduce AC-Band, a general approach for the AC problem based on multi-armed bandits that provides theoretical guarantees while exhibiting strong practical performance. We show that AC-Band requires significantly less computation time than other AC approaches providing theoretical guarantees while still yielding high-quality configurations.
