AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration
Jasmin Brandt, Elias Schede, Björn Haddenhorst, Viktor Bengs, Eyke Hüllermeier, Kevin Tierney
Abstract
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. Although this field of research has experienced much progress recently regarding approaches satisfying strong theoretical guarantees, there is still a gap between the practical performance of these approaches and the heuristic state-of-the-art approaches. 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.
BibTeX
@article{Brandt_Schede_Haddenhorst_Bengs_Hüllermeier_Tierney_2023, title={AC-Band: A Combinatorial Bandit-Based Approach to Algorithm Configuration}, volume={37}, url={https://ojs.aaai.org/index.php/AAAI/article/view/26456}, DOI={10.1609/aaai.v37i10.26456}, abstractNote={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. Although this field of research has experienced much progress recently regarding approaches satisfying strong theoretical guarantees, there is still a gap between the practical performance of these approaches and the heuristic state-of-the-art approaches. 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.}, number={10}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Brandt, Jasmin and Schede, Elias and Haddenhorst, Björn and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2023}, month={Jun.}, pages={12355-12363} }