The performance of many hard combinatorial problem solvers depends strongly
on their parameter settings, and since manual parameter tuning is both tedious
and suboptimal the AI community has recently developed several algorithm
configuration (AC) methods to automatically address this problem. While all
existing AC methods start the configuration process of an algorithm A from
scratch for each new type of benchmark instances, here we propose to exploit
information about A's performance on previous benchmarks in order to warmstart
its configuration on new types of benchmarks. We introduce two complementary
ways in which we can exploit this information to warmstart AC methods based on
a predictive model. Experiments for optimizing a very flexible modern SAT
solver on twelve different instance sets show that our methods often yield
substantial speedups over existing AC methods (up to 165-fold) and can also
find substantially better configurations given the same compute budget.

提出一种基于预测模型的算法配置方法，利用算法在先前基准测试的性能信息来对新类型的基准测试进行热启动配置，实验证明相较于现有的算法配置方法，该方法在优化硬组合问题求解器时可大幅提升速度（最高可达 165 倍），同时可以在相同的计算预算下找到更好的配置。