The Neighbours' Similar Fitness Property for Local Search

For most practical optimisation problems local search outperforms random sampling - despite the "No Free Lunch Theorem". This paper introduces a property of search landscapes termed Neighbours' Similar Fitness (NSF) that underlies the good performance of neighbourhood search in terms of local improvement. Though necessary, NSF is not sufficient to ensure that searching for improvement among the neighbours of a good solution is better than random search. The paper introduces an additional (natural) property which supports a general proof that, for NSF landscapes, neighbourhood search beats random search.

[1]  L. Darrell Whitley,et al.  Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics , 2000, PPSN.

[2]  Loris Serafino,et al.  No Free Lunch Theorem and Bayesian probability theory: two sides of the same coin. Some implications for black-box optimization and metaheuristics , 2013, ArXiv.

[3]  Christian Blum,et al.  Journal of Mathematical Modelling and Algorithms: Special issue on Hybrid Metaheuristics , 2006 .

[4]  Steffen Christensen,et al.  What can we learn from No Free Lunch? a first attempt to characterize the concept of a searchable function , 2001 .

[5]  L. Darrell Whitley,et al.  Subthreshold-seeking local search , 2006, Theor. Comput. Sci..

[6]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[7]  Conor Ryan,et al.  Proceedings of the 10th annual conference on Genetic and evolutionary computation , 2008, GECCO 2008.

[8]  J. Michael Herrmann,et al.  A Review of No Free Lunch Theorems, and Their Implications for Metaheuristic Optimisation , 2018 .

[9]  Emile H. L. Aarts,et al.  Theoretical aspects of local search , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[10]  Olivier Teytaud,et al.  Continuous Lunches Are Free Plus the Design of Optimal Optimization Algorithms , 2010, Algorithmica.

[11]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[12]  Marc Toussaint,et al.  A No-Free-Lunch Theorem for Non-Uniform Distributions of Target Functions , 2004 .

[13]  Alex Rogers,et al.  Ieee Transactions on Evolutionary Computation Genetic Drift in Genetic Algorithm Selection Schemes , 1999 .

[14]  L. Darrell Whitley,et al.  Focused no free lunch theorems , 2008, GECCO '08.

[15]  L. D. Whitley,et al.  The No Free Lunch and problem description length , 2001 .

[16]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer , 2022 .

[17]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.