Meta-optimization

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Meta-optimization concept.

In numerical optimization, meta-optimization is the use of one optimization method to tune another optimization method. Meta-optimization is reported to have been used as early as in the late 1970s by Mercer and Sampson [1] for finding optimal parameter settings of a genetic algorithm. Meta-optimization is also known in the literature as meta-evolution, super-optimization, automated parameter calibration, hyper-heuristics, etc.

Motivation[edit]

Performance landscape for differential evolution.

Optimization methods such as genetic algorithm and differential evolution have several parameters that govern their behaviour and efficiency in optimizing a given problem and these parameters must be chosen by the practitioner to achieve satisfactory results. Selecting the behavioural parameters by hand is a laborious task that is susceptible to human misconceptions of what makes the optimizer perform well.

The behavioural parameters of an optimizer can be varied and the optimization performance plotted as a landscape. This is computationally feasible for optimizers with few behavioural parameters and optimization problems that are fast to compute, but when the number of behavioural parameters increases the time usage for computing such a performance landscape increases exponentially. This is the curse of dimensionality for the search-space consisting of an optimizer's behavioural parameters. An efficient method is therefore needed to search the space of behavioural parameters.

Methods[edit]

Meta-optimization of differential evolution.

A simple way of finding good behavioural parameters for an optimizer is to employ another overlaying optimizer, called the meta-optimizer. There are different ways of doing this depending on whether the behavioural parameters to be tuned are real-valued or discrete-valued, and depending on what performance measure is being used, etc.

Meta-optimizing the parameters of a genetic algorithm was done by Grefenstette [2] and Keane,[3] amongst others, and experiments with meta-optimizing both the parameters and the genetic operators were reported by Bäck.[4] Meta-optimization of the COMPLEX-RF algorithm was done by Krus and Andersson,[5] and ,[6] where performance index of optimization based on information theory was introduced and further developed. Meta-optimization of particle swarm optimization was done by Meissner et al.[7] as well as by Pedersen and Chipperfield,[8] who also meta-optimized differential evolution. Birattari et al.[9][10] meta-optimized ant colony optimization. Statistical models have also been used to reveal more about the relationship between choices of behavioural parameters and optimization performance, see for example Francois and Lavergne,[11] and Nannen and Eiben.[12] A comparison of various meta-optimization techniques was done by Smit and Eiben.[13]

See also[edit]

References[edit]

  1. ^ Mercer, R.E.; Sampson, J.R. (1978). "Adaptive search using a reproductive metaplan". Kybernetes (The International Journal of Systems and Cybernetics) 7 (3): 215–228. doi:10.1108/eb005486. 
  2. ^ Grefenstette, J.J. (1986). "Optimization of control parameters for genetic algorithms". IEEE Transactions Systems, Man, and Cybernetics 16: 122–128. doi:10.1109/TSMC.1986.289288. 
  3. ^ Keane, A.J. (1995). "Genetic algorithm optimization in multi-peak problems: studies in convergence and robustness". Artificial Intelligence in Engineering 9 (2): 75–83. doi:10.1016/0954-1810(95)95751-Q. 
  4. ^ Bäck, T. (1994). "Parallel optimization of evolutionary algorithms". Proceedings of the International Conference on Evolutionary Computation. pp. 418–427. 
  5. ^ Krus, PK.; Andersson (Ölvander), J. (2003). "Optimizing optimization for design optimization". Proceedings of DETC’03 2003 ASME Design Engineering Technical Conferences and Computers and Information in Engineering Conference Chicago, Illinois, USA. 
  6. ^ Krus, PK.; Ölvander(Andersson), J. (2013). "Performance index and meta-optimization of a direct search optimization method". Engineering Optimization 45 (10): 1167–1185. doi:10.1080/0305215X.2012.725052. 
  7. ^ Meissner, M.; Schmuker, M.; Schneider, G. (2006). "Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training". BMC Bioinformatics 7. 
  8. ^ Pedersen, M.E.H.; Chipperfield, A.J. (2010). "Simplifying particle swarm optimization". Applied Soft Computing 10 (2): 618–628. doi:10.1016/j.asoc.2009.08.029. 
  9. ^ Birattari, M.; Stützle, T.; Paquete, L.; Varrentrapp, K. (2002). "A racing algorithm for configuring metaheuristics". Proceedings of the Genetic and Evolutionary Computation Conference (GECCO). pp. 11–18. 
  10. ^ Birattari, M. (2004). The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective (PhD thesis). Université Libre de Bruxelles. 
  11. ^ Francois, O.; Lavergne, C. (2001). "Design of evolutionary algorithms - a statistical perspective". IEEE Transactions on Evolutionary Computation 5 (2): 129–148. doi:10.1109/4235.918434. 
  12. ^ Nannen, V.; Eiben, A.E. (2006). "A method for parameter calibration and relevance estimation in evolutionary algorithms". Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation (GECCO). pp. 183–190. 
  13. ^ Smit, S.K.; Eiben, A.E. (2009). "Comparing parameter tuning methods for evolutionary algorithms". Proceedings of the IEEE Congress on Evolutionary Computation (CEC). pp. 399–406.