Gray Box Optimization for Mk Landscapes (NK Landscapes and MAX-kSAT).
This article investigates Gray Box Optimization for pseudo-Boolean optimization problems composed of M subfunctions, where each subfunction accepts at most k variables. We will refer to these as Mk Landscapes. In Gray Box Optimization, the optimizer is given access to the set of M subfunctions. We prove Gray Box Optimization can efficiently compute hyperplane averages to solve non-deceptive problems in [Formula: see text] time. Bounded separable problems are also solved in [Formula: see text] time. As a result, Gray Box Optimization is able to solve many commonly used problems from the evolutional computation literature in [Formula: see text] evaluations. We also introduce a more general class of Mk Landscapes that can be solved using dynamic programming and discuss properties of these functions. For certain type of problems Gray Box Optimization makes it possible to enumerate all local optima faster than brute force methods. We also provide evidence that randomly generated test problems are far less structured than those found in real-world problems.
Department of Computer Science, Colorado State University, USA whitley@cs.colostate.edu.
L Darrell
LD
Whitley
Department of Lenguajes y Ciencias de la Computación, University of Málaga, Spain chicano@lcc.uma.es.
Francisco
F
Chicano
Department of Computer Science, Michigan State University, USA brianwgoldman@acm.org.
Brian W
BW
Goldman
D008962:Models, Theoretical
Genetic algorithms; MAX-kSAT; Mk Landscapes; NK Landscapes; Walsh analysis; deception; gray box optimization; tree decomposition