Name
Abstract | ||
|---|---|---|
To achieve peak performance, it is often necessary to adjust the parameters of a given algorithm to the class of problem instances to be solved; this is known to be the case for popular solvers for a broad range of AI problems, including AI planning, propositional satisfiability (SAT) and answer set programming (ASP). To avoid tedious and often highly sub-optimal manual tuning of such parameters by means of ad-hoc methods, general-purpose algorithm configuration procedures can be used to automatically find performance-optimizing parameter settings. While impressive performance gains are often achieved in this manner, additional, potentially costly parameter importance analysis is required to gain insights into what parameter changes are most responsible for those improvements. Here, we show how the running time cost of ablation analysis, a well-known general-purpose approach for assessing parameter importance, can be reduced substantially by using regression models of algorithm performance constructed from data collected during the configuration process. In our experiments, we demonstrate speed-up factors between 33 and 14 727 for ablation analysis on various configuration scenarios from AI planning, SAT, ASP and mixed integer programming (MIP). |
Year | Venue | Field |
|---|---|---|
2017 | THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | Computer science,Ablation,Artificial intelligence,Machine learning |
DocType | Citations | PageRank |
Conference | 4 | 0.40 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andre Biedenkapp | 1 | 4 | 2.09 |
| Marius Thomas Lindauer | 2 | 141 | 14.87 |
| Katharina Eggensperger | 3 | 32 | 4.73 |
| Frank Hutter | 4 | 2610 | 127.14 |
| Chris Fawcett | 5 | 66 | 5.36 |
| Holger H. Hoos | 6 | 5327 | 308.70 |