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
Using Experimental Design to Find Effective Parameter Settings for Heuristics
Journal of Heuristics
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
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
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Evolving Evolutionary Algorithms Using Linear Genetic Programming
Evolutionary Computation
Experimental Research in Evolutionary Computation: The New Experimentalism (Natural Computing Series)
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Operations Research
Efficient stochastic local search for MPE solving
IJCAI'05 Proceedings of the 19th international joint conference on 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
Using Cost Distributions to Guide Weight Decay in Local Search for SAT
PRICAI '08 Proceedings of the 10th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
An experimental investigation of model-based parameter optimisation: SPO and beyond
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Bid evaluation in combinatorial auctions: optimization and learning
Software—Practice & Experience
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Parameter Tuning of a Stochastic Biological Simulator by Metaheuristics
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
An ant colony optimization approach for the multidimensional knapsack problem
Journal of Heuristics
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
Improvement strategies for the F-Race algorithm: sampling design and iterative refinement
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A gender-based genetic algorithm for the automatic configuration of algorithms
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
An evaluation of off-line calibration techniques for evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Autonomous operator management for evolutionary algorithms
Journal of Heuristics
Optimisation and generalisation: footprints in instance space
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
On-the-fly calibrating strategies for evolutionary algorithms
Information Sciences: an International Journal
Time-bounded sequential parameter optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
C-strategy: a dynamic adaptive strategy for the CLONALG algorithm
Transactions on computational science VIII
C-strategy: a dynamic adaptive strategy for the CLONALG algorithm
Transactions on computational science VIII
Tradeoffs in the empirical evaluation of competing algorithm designs
Annals of Mathematics and Artificial Intelligence
Optimization of heuristic search using recursive algorithm selection and reinforcement learning
Annals of Mathematics and Artificial Intelligence
From adaptive to more dynamic control in evolutionary algorithms
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
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
Bayesian networks to predict data mining algorithm behavior in ubiquitous computing environments
MSM'10/MUSE'10 Proceedings of the 2010 international conference on Analysis of social media and ubiquitous data
Communications of the ACM
Path Planning for UAVs Under Communication Constraints Using SPLAT! and MILP
Journal of Intelligent and Robotic Systems
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
Sequential model-based optimization for general algorithm configuration
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
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
Exploiting prior information in multi-objective route planning
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part II
Are state-of-the-art fine-tuning algorithms able to detect a dummy parameter?
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Quantifying homogeneity of instance sets for algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
International Journal of Applied Metaheuristic Computing
Automatic (offline) configuration of algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Discovering linkage points over web data
Proceedings of the VLDB Endowment
Efficient search for inputs causing high floating-point errors
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
A beginner's guide to tuning methods
Applied Soft Computing
Hi-index | 0.02 |
The determination of appropriate values for free algorithm parameters is a challenging and tedious task in the design of effective algorithms for hard problems. Such parameters include categorical choices (e.g., neighborhood structure in local search or variable/value ordering heuristics in tree search), as well as numerical parameters (e.g., noise or restart timing). In practice, tuning of these parameters is largely carried out manually by applying rules of thumb and crude heuristics, while more principled approaches are only rarely used. In this paper, we present a local search approach for algorithm configuration and prove its convergence to the globally optimal parameter configuration. Our approach is very versatile: it can, e.g., be used for minimising run-time in decision problems or for maximising solution quality in optimisation problems. It further applies to arbitrary algorithms, including heuristic tree search and local search algorithms, with no limitation on the number of parameters. Experiments in four algorithm configuration scenarios demonstrate that our automatically determined parameter settings always outperform the algorithm defaults, sometimes by several orders of magnitude. Our approach also shows better performance and greater flexibility than the recent CALIBRA system. Our ParamILS code, along with instructions on how to use it for tuning your own algorithms, is available on-line at http://www.cs.ubc.ca/labs/beta/Projects/ParamILS.