Sequential Model-Based Optimization for General Algorithm Configuration

@inproceedings{Hutter2011SequentialMO,
  title={Sequential Model-Based Optimization for General Algorithm Configuration},
  author={F. Hutter and H. Hoos and Kevin Leyton-Brown},
  booktitle={LION},
  year={2011}
}
State-of-the-art algorithms for hard computational problems often expose many parameters that can be modified to improve empirical performance. [...] Key Method In this paper, we extend this paradigm for the first time to general algorithm configuration problems, allowing many categorical parameters and optimization for sets of instances. We experimentally validate our new algorithm configuration procedure by optimizing a local search and a tree search solver for the propositional satisfiability problem (SAT…Expand
Parallel Algorithm Configuration
Warmstarting of Model-based Algorithm Configuration
Dynamic Algorithm Configuration: Foundation of a New Meta-Algorithmic Framework
Automated Configuration and Selection of SAT Solvers
Ordered racing protocols for automatically configuring algorithms for scaling performance
Identifying Key Algorithm Parameters and Instance Features Using Forward Selection
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
Automated configuration of algorithms for solving hard computational problems
Time-Bounded Sequential Parameter Optimization
Automatic Algorithm Configuration Based on Local Search
Automated Configuration of Mixed Integer Programming Solvers
Problem Structure in the Presence of Perturbations
SATzilla: Portfolio-based Algorithm Selection for SAT
Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems
...
1
2
3
4
5
...