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.
Dokumententyp: | Konferenzbeitrag (Paper) |
---|---|
Fakultät: | Mathematik, Informatik und Statistik > Informatik > Künstliche Intelligenz und Maschinelles Lernen |
Themengebiete: | 000 Informatik, Informationswissenschaft, allgemeine Werke > 000 Informatik, Wissen, Systeme |
URN: | urn:nbn:de:bvb:19-epub-107477-9 |
ISSN: | 2159-5399 |
Sprache: | Englisch |
Dokumenten ID: | 107477 |
Datum der Veröffentlichung auf Open Access LMU: | 22. Okt. 2023 14:23 |
Letzte Änderungen: | 26. Nov. 2024 17:27 |
DFG: | Gefördert durch die Deutsche Forschungsgemeinschaft (DFG) - 317046553 |