The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
ParamILS: An Automatic Algorithm Configuration Framework
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Experiments
Santner, T. J., Williams, B. J., & Notz, W. I. (2003) · Springer Series in Statistics · doi:10.1007/978-1-4757-3799-8 · Cited by 2,170
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
Stochastic Local Search: Foundations & Applications
Hoos, H. H., & St�tzle, T. (2004) · Medical Entomology and Zoology · Cited by 1,227
Self-citationA new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
SATzilla: Portfolio-based Algorithm Selection for SAT
Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2490 · Cited by 857
Self-citationMinimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
A Racing Algorithm for Configuring Metaheuristics
Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002) · Cited by 498
Reactive Search and Intelligent Optimization
Battiti, R., Brunato, M., & Mascia, F. (2008) · Operations research, computer science. Interface series · doi:10.1007/978-0-387-09624-7 · Cited by 279
Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation
Maron, O., & Moore, A. (2018) · doi:10.1184/r1/6555050 · Cited by 265
A theoretician’s guide to the experimental analysis of algorithms
Johnson, D. (2002) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/059/11 · Cited by 261
Automatic algorithm configuration based on local search
Hutter, F., Hoos, H. H., & Stützle, T. (2007) · Cited by 240
Self-citationEfficient parameter estimation for RNA secondary structure prediction
Andronescu, M., Condon, A., Hoos, H. H., Mathews, D. H., & Murphy, K. P. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm223 · Cited by 220
Self-citationScaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
Hutter, F., Tompkins, D. A. D., & Hoos, H. H. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46135-3_16 · Cited by 204
Self-citationExperimental Research in Evolutionary Computation
(2006) · Natural Computing Series · doi:10.1007/3-540-32027-x · Cited by 199
Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
Balaprakash, P., Birattari, M., & Stützle, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75514-2_9 · Cited by 197
Self-citationAutomatically configuring constraint satisfaction programs: A case study
Minton, S. (1996) · Constraints · doi:10.1007/bf00143877 · Cited by 148
The problem of tuning metaheuristics as seen from a machine learning perspective
Birattari, M., & Dorigo, M. (2004) · Cited by 128
Problem structure in the presence of perturbations
Gomes, C. P., & Selman, B. (1997) · Cited by 126
Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Hutter, F., Hamadi, Y., Hoos, H. H., et al. (2006) · Lecture notes in computer science · doi:10.1007/11889205_17 · Cited by 125
Self-citationKautz, H., Horvitz, E., Ruan, Y., Gomes, C. P., & Selman, B. (2002) · doi:10.5555/777092.777196 · Cited by 121
SATenstein : automatically building local search SAT solvers from components
KhudaBukhsh, A. R. (2009) · cIRcle (University of British Columbia) · doi:10.14288/1.0051500 · Cited by 118
A Bayesian Approach to Tackling Hard Computational ProblemsPreprint
Horvitz, E., Ruan, Y., Gomes, C. P., Kautz, H., Selman, B., & Chickering, D. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2279 · Cited by 114
A replica exchange Monte Carlo algorithm for protein folding in the HP model
Thachuk, C., Shmygelska, A., & Hoos, H. H. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-342 · Cited by 104
Self-citationBoosting Verification by Automatic Tuning of Decision Procedures
Hutter, F., Babić, D., Hoos, H. H., & Hu, A. J. (2007) · doi:10.1109/fmcad.2007.13 · Cited by 95
Self-citationAutomated configuration of algorithms for solving hard computational problems
Hutter, F. (2009) · cIRcle (University of British Columbia) · doi:10.14288/1.0051652 · Cited by 84
Self-citationCOMPOSER: a probabilistic solution to the utility problem in speed-up learning
Gratch, J. S., & DEJONG, G. F. (1992) · National Conference on Artificial Intelligence · Cited by 73
APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS
Carchrae, T., & Beck, J. C. (2005) · Computational Intelligence · doi:10.1111/j.1467-8640.2005.00278.x · Cited by 67
Structural Abstraction of Software Verification Conditions
Babić, D., & Hu, A. J. (2007) · Springer eBooks · doi:10.1007/978-3-540-73368-3_41 · Cited by 62
Tradeoffs in the empirical evaluation of competing algorithm designs
Hutter, F., Hoos, H. H., & Leyton‐Brown, K. (2010) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/s10472-010-9191-0 · Cited by 36
Self-citationGagliolo, M., & Schmidhuber, J. (2006) · Cited by 35
Gagliolo, M., & Schmidhuber, J. (2007) · Cited by 28
Finding Optimal Algorithmic Parameters Using the Mesh Adaptive Direct Search Algorithm
Audet, C., & Orban, D. (2004) · PolyPublie (École Polytechnique de Montréal) · Cited by 26
Cited by
Sequential Model-Based Optimization for General Algorithm Configuration
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25566-3_40 · Cited by 2,469
Self-citationThe irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., & Stützle, T. (2016) · Operations Research Perspectives · doi:10.1016/j.orp.2016.09.002 · Cited by 1,761
Self-citationImproving the search performance of SHADE using linear population size reduction
Tanabe, R., & Fukunaga, A. S. (2014) · 2014 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2014.6900380 · Cited by 1,625
Automated Machine Learning: Methods, Systems, Challenges
(2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5 · Cited by 1,485
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Muja, M., & Lowe, D. G. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2321376 · Cited by 1,407
Metadata
- Authors
- Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stuetzle, T.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2009-10-30
- Volume
- 36
- Pages
- 267-306
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2950680102
- Cited by
- 882
- References
- 32
- FWCI
- 22.77
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.