Simon Wessing
Mike Preuss
ABSTRACT
In this paper, we show that sequential parameter optimization (SPO), a method that was designed for (offline) parameter tuning, can be successfully used as a controller for multistart approaches of evolutionary algorithms (EA). We demonstrate this by replacing the restart heuristic of the IPOP-CMA-ES with the SPO algorithm. Experiments on the BBOB 2010 test cases suggest that the performance is at least competitive while the approach provides more options, e.g. setting more than one parameter at once. Essentially, we argue that SPO is a generalization of the IPOP heuristic and that the distinction between tuning and control is---although often useful---an artificial one.
- A. Auger and N. Hansen. A restart CMA evolution strategy with increasing population size. In IEEE Congress on Evolutionary Computation (CEC'05), volume 2, pages 1769--1776. IEEE Press, 2005.Google Scholar
Cross Ref
- T. Bartz-Beielstein, C. Lasarczyk, and M. Preuss. Sequential parameter optimization. In IEEE Congress on Evolutionary Computation (CEC'05), volume 1, pages 773--780. IEEE Press, 2005.Google ScholarCross Ref
- A. Eiben, R. Hinterding, and Z. Michalewicz. Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation, 3(2):124 --141, July 1999. Google ScholarDigital Library
- S. Finck, N. Hansen, R. Ros, and A. Auger. Real-parameter black-box optimization benchmarking 2009: Presentation of the noiseless functions. Technical Report 2009/20, Research Center PPE, 2009. Updated February 2010.Google Scholar
- N. Hansen. The CMA Evolution Strategy: A Tutorial, April 26 2008. accessed 21-01-09, http://www.bionik.tu-berlin.de/user/niko/cmatutorial.pdf.Google Scholar
- N. Hansen. Benchmarking a BI-population CMA-ES on the BBOB-2009 function testbed. In Workshop Proceedings of the GECCO Genetic and Evolutionary Computation Conference, pages 2389--2395. ACM, July 2009. Google ScholarDigital Library
- N. Hansen. CMA-ES implementation in Python. online, November 2010. http://www.lri.fr/ hansen/cma.py.Google Scholar
- N. Hansen, A. Auger, S. Finck, and R. Ros. Real-parameter black-box optimization benchmarking 2010: Experimental setup. Technical Report RR-7215, INRIA, 2010.Google Scholar
- N. Hansen and A. Ostermeier. Completely Derandomized Self-Adaptation in Evolution Strategies. Evolutionary Computation, 9(2):159--195, 2001. Google ScholarDigital Library
- H. Hoos and T. Stützle. Stochastic Local Search -- Foundations and Applications. Morgan Kaufmann, San Francisco, 2004. Google ScholarDigital Library
- S. N. Lophaven, H. B. Nielsen, and J. Søndergaard. DACE -- A Matlab Kriging Toolbox. Technical Report IMM-REP-2002--12, Informatics and Mathematical Modelling, Technical University of Denmark, Copenhagen, Denmark, August 2002.Google Scholar
- M. Lunacek, D. Whitley, and A. Sutton. The impact of global structure on search. In Parallel Problem Solving from Nature -- PPSN X, volume 5199 of Lecture Notes in Computer Science, pages 498--507. Springer Berlin / Heidelberg, 2008. Google ScholarDigital Library
- D. C. Montgomery. Design and Analysis of Experiments. Wiley, New York, 4th edition, 1997.Google Scholar
- M. Preuss, G. Rudolph, and S. Wessing. Tuning optimization algorithms for real-world problems by means of surrogate modeling. In Genetic and Evolutionary Computation Conference (GECCO), pages 401--408, 2010. Google ScholarDigital Library
- K. Price. Differential evolution vs. the functions of the second ICEO. In Proceedings of the IEEE International Congress on Evolutionary Computation, pages 153--157, 1997.Google Scholar
- R. Ros. Black-box optimization benchmarking the IPOP-CMA-ES on the noiseless testbed: comparison to the BIPOP-CMA-ES. In Proceedings of the 12th annual conference companion on Genetic and evolutionary computation, GECCO '10, pages 1503--1510. ACM, 2010. Google ScholarDigital Library
- J. Sacks, W. J. Welch, T. J. Mitchell, and H. P. Wynn. Design and analysis of computer experiments. Statistical Science, 4(4):409--423, November 1989.Google ScholarCross Ref
- T. J. Santner, B. J. Williams, and W. I. Notz. The Design and Analysis of Computer Experiments. Springer, 2003.Google ScholarCross Ref
- K. Sastry. Single and multiobjective genetic algorithm toolbox for matlab in cGoogle Scholar
- . Technical Report 2007017, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, 2007.Google Scholar
- H.-P. Schwefel. Evolution and Optimum Seeking. Wiley, New York, 1995. Google ScholarDigital Library
- R. G. Steel and J. H. Torrie. Principles and Procedures of Statistics. McGraw-Hill, 1960.Google Scholar
- S. Wessing and T. Wagner. A rank transformation can improve sequential parameter optimization. Algorithm Engineering Report TR10--2-007, Technische Universitat Dortmund, 2010.Google Scholar
- K. Zielinski and R. Laur. Stopping Criteria for a Constrained Single-Objective Particle Swarm Optimization Algorithm. Informatica, 31(1):51--59, 2007.Google Scholar
Index Terms
- When parameter tuning actually is parameter control
Recommendations
Levy distributed parameter control in differential evolution for numerical optimization
Differential evolution (DE) algorithm is a population based stochastic search technique widely applied in scientific and engineering fields for global optimization over real parameter space. The performance of DE algorithm highly depends on the ...
Parameter tuning of evolutionary algorithms: generalist vs. specialist
EvoApplicatons'10: Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part IFinding appropriate parameter values for Evolutionary Algorithms (EAs) is one of the persistent challenges of Evolutionary Computing. In recent publications we showed how the REVAC (Relevance Estimation and VAlue Calibration) method is capable to find ...
Parameter control: strategy or luck?
GECCO '13 Companion: Proceedings of the 15th annual conference companion on Genetic and evolutionary computationParameter control mechanisms in evolutionary algorithms (EAs) dynamically change the values of the EA parameters during a run. Research over the last two decades has delivered ample examples where an EA using a parameter control mechanism outperforms ...
Comments