Abstract
Automated hyperparameter optimization (HPO) has gained great popularity and is an important component of most automated machine learning frameworks. However, the process of designing HPO algorithms is still an unsystematic and manual process: new algorithms are often built on top of prior work, where limitations are identified and improvements are proposed. Even though this approach is guided by expert knowledge, it is still somewhat arbitrary. The process rarely allows for gaining a holistic understanding of which algorithmic components drive performance and carries the risk of overlooking good algorithmic design choices. We present a principled approach to automated benchmark-driven algorithm design applied to multifidelity HPO (MF-HPO). First, we formalize a rich space of MF-HPO candidates that includes, but is not limited to, common existing HPO algorithms and then present a configurable framework covering this space. To find the best candidate automatically and systematically, we follow a programming-by-optimization approach and search over the space of algorithm candidates via Bayesian optimization. We challenge whether the found design choices are necessary or could be replaced by more naive and simpler ones by performing an ablation analysis. We observe that using a relatively simple configuration (in some ways, simpler than established methods) performs very well as long as some critical configuration parameters are set to the right value.
| Dokumententyp: | Zeitschriftenartikel |
|---|---|
| Fakultät: | Mathematik, Informatik und Statistik > Statistik |
| Themengebiete: | 500 Naturwissenschaften und Mathematik > 510 Mathematik |
| ISSN: | 1089-778X |
| Sprache: | Englisch |
| Dokumenten ID: | 110996 |
| Datum der Veröffentlichung auf Open Access LMU: | 02. Apr. 2024, 07:22 |
| Letzte Änderungen: | 02. Apr. 2024, 07:22 |
- Dokument bearbeiten
