Are State-of-the-Art Fine-Tuning Algorithms Able to Detect a Dummy Parameter?

Currently, there exist several offline calibration techniques that can be used to fine-tune the parameters of a metaheuristic. Such techniques require, however, to perform a considerable number of independent runs of the metaheuristic in order to obtain meaningful information. Here, we are interested on the use of this information for assisting the algorithm designer to discard components of a metaheuristic (e.g., an evolutionary operator) that do not contribute to improving its performance (we call them "ineffective components"). In our study, we experimentally analyze the information obtained from three offline calibration techniques: F-Race, ParamILS and Revac. Our preliminary results indicate that these three calibration techniques provide different types of information, which makes it necessary to conduct a more in-depth analysis of the data obtained, in order to detect the ineffective components that are of our interest.

[1]  Martijn C. Schut,et al.  New Ways to Calibrate Evolutionary Algorithms , 2008, Advances in Metaheuristics for Hard Optimization.

[2]  Thomas Stützle,et al.  Modern Continuous Optimization Algorithms for Tuning Real and Integer Algorithm Parameters , 2010, ANTS Conference.

[3]  Thomas Stützle,et al.  A Racing Algorithm for Configuring Metaheuristics , 2002, GECCO.

[4]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[5]  Thomas Bartz-Beielstein,et al.  Sequential parameter optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.

[6]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[7]  A. E. Eiben,et al.  Efficient relevance estimation and value calibration of evolutionary algorithm parameters , 2007, 2007 IEEE Congress on Evolutionary Computation.

[8]  Thomas Stützle,et al.  Continuous optimization algorithms for tuning real and integer parameters of swarm intelligence algorithms , 2011, Swarm Intelligence.

[9]  Michèle Sebag,et al.  Analyzing bandit-based adaptive operator selection mechanisms , 2010, Annals of Mathematics and Artificial Intelligence.

[10]  Bertrand Neveu,et al.  C-Strategy: A Dynamic Adaptive Strategy for the CLONALG Algorithm , 2010, Trans. Comput. Sci..

[11]  Thomas Stützle,et al.  Automatic Algorithm Configuration Based on Local Search , 2007, AAAI.

[12]  Zbigniew Michalewicz,et al.  Advances in Metaheuristics for Hard Optimization , 2008, Advances in Metaheuristics for Hard Optimization.

[13]  María Cristina Riff,et al.  On-the-fly calibrating strategies for evolutionary algorithms , 2011, Inf. Sci..

[14]  Frédéric Saubion,et al.  Autonomous operator management for evolutionary algorithms , 2010, J. Heuristics.