When and Why Metaheuristics Researchers can Ignore ``No Free Lunch'' Theorems

Created by W.Langdon from gp-bibliography.bib Revision:1.7615

@Article{McDermott:2020:SNCS,

• author = "James McDermott",
• title = "When and Why Metaheuristics Researchers can Ignore ``No Free Lunch'' Theorems",
• journal = "SN Computer Science",
• year = "2020",
• volume = "1",
• pages = "60",
• keywords = "genetic algorithms, genetic programming, Metaheuristics, No free lunch, NFL, Evolutionary computation, Problem domain, Anthropic principle",
• ISSN = "2661-8907",
• URL = "http://arxiv.org/abs/1906.03280",
• DOI = "doi:https://doi.org/10.1007/s42979-020-0063-3",
• abstract = "The No Free Lunch (NFL) theorem for search and optimisation states that averaged across all possible objective functions on a fixed search space, all search algorithms perform equally well. Several refined versions of the theorem find a similar outcome when averaging across smaller sets of functions. We argue that NFL results continue to be misunderstood by many researchers, and addresses this issue in several ways. Existing arguments against real-world implications of NFL results are collected and re-stated for accessibility, and new ones are added. Specific misunderstandings extant in the literature are identified, with speculation as to how they may have arisen. This paper presents an argument against a common paraphrase of NFL findings. That algorithms must be specialised to problem domains in order to do well. After problematising the usually undefined term domain. It provides novel concrete counter-examples illustrating cases where NFL theorems do not apply. In conclusion it offers a novel view of the real meaning of NFL, incorporating the anthropic principle and justifying the position that in many common situations researchers can ignore NFL.",

}

Genetic Programming entries for James McDermott

Citations