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.
翻译:我们研究了算法配置(AC)问题,其中人们试图以自动方式找到特定目标算法的最佳参数配置。最近,在设计满足强力理论保证的AC方法方面取得了显著进展。然而,这些方法的实际表现与最先进的Hellistic方法之间仍然存在着巨大差距。为此,我们引入了AC-Band,这是针对AC问题的一种基于多武装匪徒的一般方法,它提供理论保证,同时表现出很强的实际表现。我们表明AC-Band所需要的计算时间比其他AC方法要少得多,它提供理论保证,同时仍然产生高质量的配置。