An Empirical Evaluation of O(1) Steepest Descent for NK-Landscapes

New methods make it possible to do approximate steepest descent in O(1) time per move for k-bounded pseudo-Boolean functions using stochastic local search. It is also possible to use the average fitness over the Hamming distance 2 neighborhood as a surrogate fitness function and still retain the O(1) time per move. These are average complexity results. In light of these new results, we examine three factors that can influence both the computational cost and the effectiveness of stochastic local search: 1) Fitness function: f(x) or a surrogate; 2) Local optimum escape method: hard random or soft restarts; 3) Descent strategy: next or steepest. We empirically assess these factors in a study of local search for solving NK-landscape problems.

[1]  L. Darrell Whitley,et al.  Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT , 2012, GECCO '12.

[2]  Janet Wiles,et al.  A comparison of neutral landscapes - NK, NKp and NKq , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[4]  Weixiong Zhang,et al.  Configuration landscape analysis and backbone guided local search: Part I: Satisfiability and maximum satisfiability , 2004, Artif. Intell..

[5]  Andrew M. Sutton,et al.  Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time , 2012, Theor. Comput. Sci..

[6]  E. D. Weinberger,et al.  The NK model of rugged fitness landscapes and its application to maturation of the immune response. , 1989, Journal of theoretical biology.

[7]  L. Darrell Whitley,et al.  A Walsh Analysis of NK-Landscapes , 1997, ICGA.

[8]  Robert B. Heckendorn Embedded Landscapes , 2002, Evolutionary Computation.

[9]  L. Darrell Whitley,et al.  A Tractable Walsh Analysis of SAT and its Implications for Genetic Algorithms , 1998, AAAI/IAAI.

[10]  Wenxiang Chen,et al.  Constant time Steepest Ascent Local Search with Statistical Lookahead for NK-Landscapes , 2012 .

[12]  Sébastien Vérel,et al.  Local Optima Networks of NK Landscapes With Neutrality , 2011, IEEE Transactions on Evolutionary Computation.