A graphical model for evolutionary optimization.
We present a statistical model of empirical optimization that admits the creation of algorithms with explicit and intuitively defined desiderata. Because No Free Lunch theorems dictate that no optimization algorithm can be considered more efficient than any other when considering all possible functions, the desired function class plays a prominent role in the model. In particular, this provides a direct way to answer the traditionally difficult question of what algorithm is best matched to a particular class of functions. Among the benefits of the model are the ability to specify the function class in a straightforward manner, a natural way to specify noisy or dynamic functions, and a new source of insight into No Free Lunch theorems for optimization.
Monson
Christopher K
CK
Department of Computer Science, Brigham Young University, Provo, Utah 84602, USA. c@cs.byu.edu
Seppi
Kevin D
KD
D000465:Algorithms; D008962:Models, Theoretical