ParamILS: An Automatic Algorithm Configuration Framework
Frank Hutter, Holger H. Hoos, Kevin Leyton‐Brown et al. · Journal of Artificial Intelligence Research · 2009
The identification of performance-optimizing parameter settings is an important part of the development and application of algorithms. We describe an automatic framework for this algorithm configuration problem. More formally, we provide methods for optimizing a target algorithms performance on a given class of problem instances by varying a set of ordinal and/or categorical parameters. We review a family of local-search-based algorithm configuration procedures and present novel techniques for accelerating them by adaptively limiting the time spent for evaluating individual configurations. We describe the results of a comprehensive experimental evaluation of our methods, based on the configuration of prominent complete and incomplete algorithms for SAT. We also present what is, to our knowledge, the first published work on automatically configuring the CPLEX mixed integer programming solver. All the algorithms we considered had default parameter settings that were manually identified with considerable effort. Nevertheless, using our automated algorithm configuration procedures, we achieved substantial and consistent performance improvements.
Cited by 882 works. doi:10.1613/jair.2861 Open-access PDF
Authors
References
- A new method for solving hard satisfiability problems
- Introduction to Stochastic Search and Optimization
- The Design and Analysis of Computer Experiments
- Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
- Stochastic Local Search: Foundations & Applications
- Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation
- Automated configuration of algorithms for solving hard computational problems
- SATzilla: Portfolio-based Algorithm Selection for SAT
- A Racing Algorithm for Configuring Metaheuristics
- Towards a universal test suite for combinatorial auction algorithms