Hydra: Automatically configuring algorithms for portfolio-based selection

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2010, Pages 210-216

  Xu, Lin ^a   Hoos, Holger H ^a   Leyton Brown, Kevin ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STOCHASTIC SYSTEMS;

ALGORITHM SELECTION; AUTOMATED ALGORITHMS; COMBINATORIAL PROBLEM; DOMAIN KNOWLEDGE; HIGH PERFORMANCE ALGORITHMS; NOVEL TECHNIQUES; PROBLEM DOMAIN; STOCHASTIC LOCAL SEARCHES;

ITERATIVE METHODS;

EID: 77958579640     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Ansóteguitegui, C; Sellmann, M.; and Tierney, K. 2009. A gender-based genetic algorithm for the automatic configuration of algorithms. In Proc. CP, 142-157.
2. Balaprakash, P.; Birattari, M.; and Stützle, T. 2007. Improvement strategies for the F-race algorithm: Sampling design and iterative refinement. In Hybrid Metaheuristics, 108-122.
3. Carchrae, T., and Beck, J. C. 2005. Applying machine learning to low knowledge control of optimization algorithms. Computational Intelligence 21 (4):373-387.
4. Fukunaga, A. S. 2002. Automated discovery of composite sat variable-selection heuristics. In Proc. AAAI, 641-648.
5. Gagliolo, M, and Schmidhuber, J. 2006. Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence 47(3-4):295-328.
6. Gaspero, L. D., and Schaerf, A. 2007. EasySyn++: A tool for automatic synthesis of stochastic local search algorithms. In Proc. SLS, 177-181.
7. Gomes, C. P., and Selman, B. 2001. Algorithm portfolios. Artificial Intelligence 126(1-2):43-62.
8. Gratch, J., and Dejong, G. 1992. COMPOSER: A proba- bilistic solution to the utility problem in speed-up learning. In Proc. AAAI, 235-240.
9. Guerri, A., and Milano, M. 2004. Learning techniques for automatic algorithm portfolio selection. In Proc. ECAI, 475-479
10. Huberman, B.; Lukose, R.; and Hogg, T. 1997. An economics approach to hard computational problems. Science 265:51-54.
11. Hutter, F.; Babić, D.; Hoos, H. H.; and Hu, A. J. 2007. Boosting verification by automatic tuning of decision procedures. In Proc. FMCAD, 27-34.
12. Hutter, F.; Hoos, H. H.; Leyton-Brown, K.; and Stutzle, T. 2009. ParamlLS: An automatic algorithm configuration framework. JAIR 36:267-306.
13. KhudaBukhsh, A. R.; Xu, L.; Hoos, H. H.; and Leyton-Brown, K. 2009. SATenstein: Automatically building local search SAT solvers from components. In Proc. IJCAI, 517-524.
14. Leyton-Brown, K.; Nudelman, E.; Andrew, G.; McFadden, J.; and Shoham, Y. 2003a. Boosting as a metaphor for algorithm design. In Proc. CP, 899-903.
15. Leyton-Brown, K.; Nudelman, E.; Andrew, G.; McFadden, J.; and Shoham, Y. 2003b. A portfolio approach to algorithm selection. In Proc. IJCAI, 1542-1543
16. Leyton-Brown, K.; Nudelman, E.; and Shoham, Y. 2009, Empirical hardness models: Methodology and a case study on combinatorial auctions. Journal of the ACM 56(4): 1-52.
17. Malitsky, Y., and Sellmann, M. 2009. Stochastic offline programming. In Proc. CP, 784-791.
18. Minton, S. 1993. An analytic learning system for specializing heuristics. In Proc. IJCAI, 922-929.
19. Monette, J.; Deville, Y; and van Hentenryck, P. 2009. Aeon: Synthesizing scheduling algorithms from high-level models. In INFORMS Computing Society Conference, 43-59.
20. Nudelman, E.; Leyton-Brown, K,; Devkar, A.; Shoham, Y; and Hoos, H. 2004. Understanding random SAT: Beyond the clauses-to-variables ratio. In Proc. CP, 438-452.
21. O'Mahony, E.; Hebrard, E.; Holland, A.; Nugent, C; and O'Sullivan, B. 2008. Using case-based reasoning in an algorithm portfolio for constraint solving. In Proc. Irish Conf. on Artificial Intelligence and Cognitive Science.
22. Rice, J. R. 1976. The algorithm selection problem. Advances in Computers 15:65-118.
23. Streeter, M.; Golovin, D,; and Smith, S. F. 2007. Combining multiple heuristics online. In Proc. AAAI, 1197-1203.
24. Xu, L.; Hutter, F.; Hoos, H. H.; and Leyton-Brown, K, 2008, SATzilla: portfolio-based algorithm selection for SAT. JAIR 32:565-606
25. Xu, L,; Hutter, R; Hoos, H, H.; and Leyton-Brown, K. 2009. SATzilla2009: An automatic algorithm portfolio for SAT. Solver description, 2009 SAT Competition.