Algorithm configuration (AC) is concerned with the automated search of the
most suitable parameter configuration of a parametrized algorithm. There is
currently a wide variety of AC problem variants and methods proposed in the
literature. Existing reviews do not take into account all derivatives of the AC
problem, nor do they offer a complete classification scheme. To this end, we
introduce taxonomies to describe the AC problem and features of configuration
methods, respectively. We review existing AC literature within the lens of our
taxonomies, outline relevant design choices of configuration approaches,
contrast methods and problem variants against each other, and describe the
state of AC in industry. Finally, our review provides researchers and
practitioners with a look at future research directions in the field of AC.

该论文介绍了关于算法配置问题的各种变体和方法，提出了用于描述算法配置问题和配置方法特征的分类法，并在此基础上回顾了已有的算法配置文献，提出了各种配置方法的设计选择，以及针对不同问题变体的对比方法，最终总结了行业中算法配置的现状并为未来研究提供了方向。