Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Artificial Intelligence - Special volume on constraint-based reasoning
Morphing: combining structure and randomness
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Using Experimental Design to Find Effective Parameter Settings for Heuristics
Journal of Heuristics
Efficient Global Optimization of Expensive Black-Box Functions
Journal of Global Optimization
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A Bayesian Approach to Tackling Hard Computational Problems
UAI '01 Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Introduction to Stochastic Search and Optimization
Introduction to Stochastic Search and Optimization
A mixture-model for the behaviour of SLS algorithms for SAT
Eighteenth national conference on Artificial intelligence
Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A study of the lot-sizing polytope
Mathematical Programming: Series A and B
Method-specific dynamic compilation using logistic regression
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Experimental Research in Evolutionary Computation: The New Experimentalism (Natural Computing Series)
Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization
SIAM Journal on Optimization
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Operations Research
Boosting Verification by Automatic Tuning of Decision Procedures
FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Understanding the role of noise in stochastic local search: Analysis and experiments
Artificial Intelligence
Reactive Search and Intelligent Optimization
Reactive Search and Intelligent Optimization
An experimental investigation of model-based parameter optimisation: SPO and beyond
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Automatic algorithm configuration based on local search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
Adaptive problem-solving for large-scale scheduling problems: a case study
Journal of Artificial Intelligence Research
An analytic learning system for specializing heuristics
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient stochastic local search for MPE solving
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Structural abstraction of software verification conditions
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Improvement strategies for the F-Race algorithm: sampling design and iterative refinement
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Problem structure in the presence of perturbations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Benchmarking SAT solvers for bounded model checking
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Using CBR to select solution strategies in constraint programming
ICCBR'05 Proceedings of the 6th international conference on Case-Based Reasoning Research and Development
Consultant-guided search: a new metaheuristic for combinatorial optimization problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
An experimental study on robust parameter settings
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
ISAC --Instance-Specific Algorithm Configuration
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Modern continuous optimization algorithms for tuning real and integer algorithm parameters
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Off-line vs. on-line tuning: a study on MAX–MIN ant system for the TSP
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Optimisation and generalisation: footprints in instance space
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Consultant-guided search algorithms with local search for the traveling salesman problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
IEEE Transactions on Evolutionary Computation - Special issue on preference-based multiobjective evolutionary algorithms
Time-bounded sequential parameter optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Consultant-guided search algorithms for the quadratic assignment problem
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A hybrid heuristic approach for solving the generalized traveling salesman problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Instance-based parameter tuning for evolutionary AI planning
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
A portfolio solver for answer set programming: preliminary report
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Captain Jack: new variable selection heuristics in local search for SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Learning polarity from structure in SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Efficient multi-start strategies for local search algorithms
Journal of Artificial Intelligence Research
Computers and Operations Research
Communications of the ACM
Dynamic scoring functions with variable expressions: new SLS methods for solving SAT
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Automated configuration of mixed integer programming solvers
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Instance-Based parameter tuning via search trajectory similarity clustering
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Fine-Tuning algorithm parameters using the design of experiments approach
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Sequential model-based optimization for general algorithm configuration
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
HAL: a framework for the automated analysis and design of high-performance algorithms
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A probabilistic iterative local search algorithm applied to full model selection
CIARP'11 Proceedings of the 16th Iberoamerican Congress conference on Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Hyper-heuristics with low level parameter adaptation
Evolutionary Computation
Meta-optimization for parameter tuning with a flexible computing budget
Proceedings of the 14th annual conference on Genetic and evolutionary computation
A dynamic island model for adaptive operator selection
Proceedings of the 14th annual conference on Genetic and evolutionary computation
An exploration-exploitation compromise-based adaptive operator selection for local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Instance-Specific algorithm configuration as a method for non-model-based portfolio generation
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Macro learning in planning as parameter configuration
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Calibrating continuous multi-objective heuristics using mixture experiments
Journal of Heuristics
Online speedup learning for optimal planning
Journal of Artificial Intelligence Research
Constraint programming and a usability quest
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Parallel algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Quantifying homogeneity of instance sets for algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Automatically configuring algorithms for scaling performance
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Learning algorithm portfolios for parallel execution
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Configuring simulation algorithms with ParamILS
Proceedings of the Winter Simulation Conference
International Journal of Applied Metaheuristic Computing
Learn-and-Optimize: a parameter tuning framework for evolutionary AI planning
EA'11 Proceedings of the 10th international conference on Artificial Evolution
A method to avoid duplicative flipping in local search for SAT
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Multi-objective AI planning: comparing aggregation and pareto approaches
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
Ordered racing protocols for automatically configuring algorithms for scaling performance
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Non stationary operator selection with island models
Proceedings of the 15th annual conference on Genetic and evolutionary computation
An analysis of post-selection in automatic configuration
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Is the meta-EA a viable optimization method?
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Automatic (offline) configuration of algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
The consultation timetabling problem at Danish high schools
Journal of Heuristics
Weight-enhanced diversification in stochastic local search for satisfiability
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Pareto-based multiobjective AI planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Using automatic programming to generate state-of-the-art algorithms for random 3-SAT
Journal of Heuristics
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Journal of Heuristics
Proceedings of the 5th ACM/SPEC international conference on Performance engineering
Simple algorithm portfolio for SAT
Artificial Intelligence Review
Efficient planning through automatic configuration and machine learning
AI Communications
Hi-index | 0.02 |
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 algorithm's 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.