ParamILS: An automatic algorithm configuration framework

Journal of Artificial Intelligence Research

Volumn 36, Issue , 2009, Pages 267-306

  Hutter, Frank ^a   Hoos, Holger H ^a   Leyton Brown, Kevin ^a   Stützle, Thomas ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED ALGORITHMS; AUTOMATIC ALGORITHMS; CONSISTENT PERFORMANCE; DEFAULT PARAMETERS; EXPERIMENTAL EVALUATION; INDIVIDUAL CONFIGURATION; MIXED INTEGER PROGRAMMING; NOVEL TECHNIQUES; OPTIMIZING PARAMETERS; PROBLEM INSTANCES; SEARCH-BASED ALGORITHMS; TIME SPENT;

INTEGER PROGRAMMING;

ALGORITHMS;

EID: 73649115991     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2808     Document Type: Article

References (60)

1. Adenso-Diaz, B. & Laguna, M. (2006). Fine-tuning of algorithms using fractional experimental design and local search. Operations Research, 54(1), 99-114.
2. Aktürk, S. M., Atamtürk, A., & Gürel, S. (2007). A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Research Report BCOL.07.01, University of California-Berkeley.
3. Andronescu, M., Condon, A., Hoos, H. H., Mathews, D. H., & Murphy, K. P. (2007). Efficient parameter estimation for RNA secondary structure prediction. Bioinformatics, 23, i19-i28. (Pubitemid 47244382)
4. Atamtürk, A. (2003). On the facets of the mixed-integer knapsack polyhedron. Mathematical Programming, 98, 145-175.
5. Atamtürk, A. & Muñoz, J. C. (2004). A study of the lot-sizing polytope. Mathematical Programming, 99, 443-465.
6. Audet, C. & Orban, D. (2006). Finding optimal algorithmic parameters using the mesh adaptive direct search algorithm. SIAM Journal on Optimization, 17(3), 642-664.
7. Babić, D. & Hu, A. J. (2007). Structural Abstraction of Software Verification Conditions. In W. Damm, H. H. (Ed.), Computer Aided Verification: 19th International Conference, CAV 2007, volume 4590 of Lecture Notes in Computer Science, (pp. 366-378). Springer Verlag, Berlin, Germany.
8. Balaprakash, P., Birattari, M., & Stützle, T. (2007). Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement. In Bartz-Beielstein, T., Aguilera, M. J. B., Blum, C., Naujoks, B., Roli, A., Rudolph, G., & Sampels, M. (Eds.), 4th International Workshop on Hybrid Metaheuristics (MH'07), (pp. 108-122).
9. Bartz-Beielstein, T. (2006). Experimental Research in Evolutionary Computation: The New Experimentalism. Natural Computing Series. Springer Verlag, Berlin, Germany.
10. Battiti, R., Brunato, M., & Mascia, F. (2008). Reactive Search and Intelligent Optimization, volume 45 of Operations research/Computer Science Interfaces. Springer Verlag. Available online at http://reactive-search.org/ thebook.
11. Birattari, M. (2004). The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective. PhD thesis, Université Libre de Bruxelles, Brussels, Belgium.
12. Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring meta-heuristics. In Langdon, W. B., Cantu-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M. A., Schultz, A. C., Miller, J. F., Burke, E., & Jonoska, N. (Eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), (pp. 11-18). Morgan Kaufmann Publishers, San Francisco, CA, USA.
13. Carchrae, T. & Beck, J. C. (2005). Applying machine learning to low-knowledge control of optimization algorithms. Computational Intelligence, 21(4), 372-387.
14. Cavazos, J. & O'Boyle, M. F. P. (2006). Method-specific dynamic compilation using logistic regression. In Cook, W. R. (Ed.), Proceedings of the ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA-06), (pp. 229-240)., New York, NY, USA. ACM Press.
15. Coy, S. P., Golden, B. L., Runger, G. C., & Wasil, E. A. (2001). Using experimental design to find effective parameter settings for heuristics. Journal of Heuristics, 7(1), 77-97.
16. Diao, Y., Eskesen, F., Froehlich, S., Hellerstein, J. L., Spainhower, L., & Surendra, M. (2003). Generic online optimization of multiple configuration parameters with application to a database server. In Brunner, M. & Keller, A. (Eds.), 14th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management (DSOM-03), volume 2867 of Lecture Notes in Computer Science, (pp. 3-15). Springer Verlag, Berlin, Germany.
17. Fawcett, C., Hoos, H. H., & Chiarandini, M. (2009). An automatically configured modular algorithm for post enrollment course timetabling. Technical Report TR-2009-15, University of British Columbia, Department of Computer Science.
18. Gagliolo, M. & Schmidhuber, J. (2006). Dynamic algorithm portfolios. In Amato, C., Bernstein, D., & Zilberstein, S. (Eds.), Ninth International Symposium on Artificial Intelligence and Mathematics (AI-MATH-06).
19. Gagliolo, M. & Schmidhuber, J. (2007). Learning restart strategies. In Veloso, M. M. (Ed.), Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), volume 1, (pp. 792-797). Morgan Kaufmann Publishers, San Francisco, CA, USA.
20. Gebruers, C., Hnich, B., Bridge, D., & Freuder, E. (2005). Using CBR to select solution strategies in constraint programming. In Muñoz-Avila, H. & Ricci, F. (Eds.), Proceedings of the 6th International Conference on Case Based Reasoning (ICCBR'05), volume 3620 of Lecture Notes in Computer Science, (pp. 222-236). Springer Verlag, Berlin, Germany.
21. Gent, I. P., Hoos, H. H., Prosser, P., & Walsh, T. (1999). Morphing: Combining structure and randomness. In Hendler, J. & Subramanian, D. (Eds.), Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), (pp. 654-660)., Orlando, Florida. AAAI Press/The MIT Press, Menlo Park, CA, USA.
22. Gomes, C. P. & Selman, B. (1997). Problem structure in the presence of perturbations. In Kuipers, B. & Webber, B. (Eds.), Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), (pp. 221-226). AAAI Press/The MIT Press, Menlo Park, CA, USA.
23. Gratch, J. & Chien, S. A. (1996). Adaptive problem-solving for large-scale scheduling problems: A case study. Journal of Artificial Intelligence Research, 4, 365-396.
24. Gratch, J. & Dejong, G. (1992). Composer: A probabilistic solution to the utility problem in speed-up learning. In Rosenbloom, P. & Szolovits, P. (Eds.), Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92), (pp. 235-240). AAAI Press/The MIT Press, Menlo Park, CA, USA.
25. Hoos, H. H. (2002). A mixture-model for the behaviour of SLS algorithms for SAT. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02), (pp. 661-667)., Edmonton, Alberta, Canada.
26. Hoos, H. H. (2008). Computer-aided design of high-performance algorithms. Technical Report TR-2008-16, University of British Columbia, Department of Computer Science.
27. Hoos, H. H. & Stützle, T. (2005). Stochastic Local Search - Foundations & Applications. Morgan Kaufmann Publishers, San Francisco, CA, USA.
28. Horvitz, E., Ruan, Y., Gomes, C. P., Kautz, H., Selman, B., & Chickering, D. M. (2001). A Bayesian approach to tackling hard computational problems. In Breese, J. S. & Koller, D. (Eds.), Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (UAI'01), (pp. 235-244). Morgan Kaufmann Publishers, San Francisco, CA, USA.
29. Hutter, F. (2009). Automated Configuration of Algorithms for Solving Hard Computational Problems. PhD thesis, University Of British Columbia, Department of Computer Science, Vancouver, Canada.
30. Hutter, F., Babić, D., Hoos, H. H., & Hu, A. J. (2007). Boosting Verification by Automatic Tuning of Decision Procedures. In Proceedings of Formal Methods in Computer Aided Design (FMCAD'07), (pp. 27-34)., Washington, DC, USA. IEEE Computer Society.
31. Hutter, F., Hamadi, Y., Hoos, H. H., & Leyton-Brown, K. (2006). Performance prediction and automated tuning of randomized and parametric algorithms. In Benhamou, F. (Ed.), Principles and Practice of Constraint Programming - CP 2006: Twelfth International Conference, volume 4204 of Lecture Notes in Computer Science, (pp. 213-228). Springer Verlag, Berlin, Germany.
32. Hutter, F., Hoos, H., & Leyton-Brown, K. (2009). Tradeoffs in the empirical evaluation of competing algorithm designs. Technical Report TR-2009-21, University of British Columbia, Department of Computer Science.
33. Hutter, F., Hoos, H. H., Leyton-Brown, K., & Murphy, K. P. (2009). An experimental investigation of model-based parameter optimisation: SPO and beyond. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2009), (pp. 271-278).
34. Hutter, F., Hoos, H. H., & Stützle, T. (2005). Efficient stochastic local search for MPE solving. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), (pp. 169-174).
35. Hutter, F., Hoos, H. H., & Stützle, T. (2007). Automatic algorithm configuration based on local search. In Howe, A. & Holte, R. C. (Eds.), Proceedings of the Twenty-second National Conference on Artificial Intelligence (AAAI'07), (pp. 1152-1157). AAAI Press/The MIT Press, Menlo Park, CA, USA.
36. Hutter, F., Tompkins, D. A. D., & Hoos, H. H. (2002). Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In Hentenryck, P. V. (Ed.), Principles and Practice of Constraint Programming - CP 2002: Eighth International Conference, volume 2470 of Lecture Notes in Computer Science, (pp. 233-248). Springer Verlag, Berlin, Germany.
37. Johnson, D. S. (2002). A theoretician's guide to the experimental analysis of algorithms. In Goldwasser, M. H., Johnson, D. S., & McGeoch, C. C. (Eds.), Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, (pp. 215-250). American Mathematical Society, Providence, RI, USA.
38. Jones, D. R., Schonlau, M., & Welch, W. J. (1998). Efficient global optimization of expensive black box functions. Journal of Global Optimization, 13, 455-492.
39. Kask, K. & Dechter, R. (1999). Stochastic local search for Bayesian networks. In The Seventh International Workshop on Artificial Intelligence and Statistics (AISTATS'99).
40. Kautz, H., Horvitz, E., Ruan, Y., Gomes, C. P., & Selman, B. (2002). Dynamic restart policies. In Dechter, R., Kearns, M., & Sutton, R. (Eds.), Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI'02), (pp. 674-681). AAAI Press/The MIT Press, Menlo Park, CA, USA.
41. KhudaBukhsh, A., Xu, L., Hoos, H. H., & Leyton-Brown, K. (2009). SATenstein: Automatically building local search sat solvers from components. In Proceedings of the Twenty-first International Joint Conference on Artificial Intelligence (IJCAI'09), (pp. 517-524).
42. Le Berre, D. & Simon, L. (2004). Fifty-five solvers in Vancouver: The SAT 2004 competition. In Hoos, H. H. & Mitchell, D. G. (Eds.), Theory and Applications of Satisfiability Testing: Proceedings of the Seventh International Conference (SAT'04), volume 3542 of Lecture Notes in Computer Science, (pp. 321-344). Springer Verlag.
43. Leyton-Brown, K., Nudelman, E., & Shoham, Y. (2002). Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Hentenryck, P. V. (Ed.), Principles and Practice of Constraint Programming - CP 2002: Eighth International Conference, volume 2470 of Lecture Notes in Computer Science, (pp. 556-572). Springer Verlag, Berlin, Germany.
44. Leyton-Brown, K., Pearson, M., & Shoham, Y. (2000). Towards a universal test suite for combinatorial auction algorithms. In Jhingran, A., Mason, J. M., & Tygar, D. (Eds.), EC '00: Proceedings of the 2nd ACM conference on Electronic commerce, (pp. 66-76)., New York, NY, USA. ACM.
45. Lourenço, H. R., Martin, O., & Stützle, T. (2002). Iterated local search. In F. Glover & G. Kochenberger (Eds.), Handbook of Metaheuristics (pp. 321-353). Kluwer Academic Publishers, Norwell, MA, USA.
46. Maron, O. & Moore, A. (1994). Hoeffding races: Accelerating model selection search for classification and function approximation. In Cowan, J. D., Tesauro, G., & Alspector, J. (Eds.), Advances in Neural Information Processing Systems 7 (NIPS-94), volume 6, (pp. 59-66). Morgan Kaufmann Publishers, San Francisco, CA, USA.
47. Mengshoel, O. J. (2008). Understanding the role of noise in stochastic local search: Analysis and experiments. Artificial Intelligence, 172(8-9), 955-990.
48. Minton, S. (1993). An analytic learning system for specializing heuristics. In Bajcsy, R. (Ed.), Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI'93), (pp. 922-929). Morgan Kaufmann Publishers, San Francisco, CA, USA.
49. Minton, S. (1996). Automatically configuring constraint satisfaction programs: A case study. Constraints, 1(1), 1-40.
50. Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Artificial Intelligence, 58(1), 161-205.
51. Patterson, D. J. & Kautz, H. (2001). Auto-WalkSAT: a self-tuning implementation of WalkSAT. In Electronic Notes in Discrete Mathematics (ENDM), 9.
52. Ridge, E. & Kudenko, D. (2006). Sequential experiment designs for screening and tuning parameters of stochastic heuristics. In Paquete, L., Chiarandini, M., & Basso, D. (Eds.), Workshop on Empirical Methods for the Analysis of Algorithms at the Ninth International Conference on Parallel Problem Solving from Nature (PPSN), (pp. 27-34).
53. Santner, T. J., Williams, B. J., & Notz, W. I. (2003). The Design and Analysis of Computer Experiments. Springer Verlag, New York.
54. Selman, B., Levesque, H. J., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Rosenbloom, P. & Szolovits, P. (Eds.), Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92), (pp. 440-446). AAAI Press/The MIT Press, Menlo Park, CA, USA.
55. Spall, J. C. (2003). Introduction to Stochastic Search and Optimization. New York, NY, USA: John Wiley & Sons, Inc.
56. Terashima-Marín, H., Ross, P., & Valenzuela-Réndon, M. (1999). Evolution of constraint satisfaction strategies in examination timetabling. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), (pp. 635-642). Morgan Kaufmann.
57. Thachuk, C., Shmygelska, A., & Hoos, H. H. (2007). A replica exchange monte carlo algorithm for protein folding in the hp model. BMC Bioinformatics, 8, 342-342.
58. Tompkins, D. A. D. & Hoos, H. H. (2004). UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT & MAX-SAT. In Theory and Applications of Satisfiability Testing: Proceedings of the Seventh International Conference (SAT'04), volume 3542, (pp. 306-320). Springer Verlag, Berlin, Germany.
59. Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008). SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research, 32, 565-606.
60. Zarpas, E. (2005). Benchmarking SAT Solvers for Bounded Model Checking. In Bacchus, F. & Walsh, T. (Eds.), Theory and Applications of Satisfiability Testing: Proceedings of the Eighth International Conference (SAT'05), volume 3569 of Lecture Notes in Computer Science, (pp. 340-354). Springer Verlag.