Remarks on a recent paper on the "no free lunch" theorems

Authors:
M. Koppen;D. H. Wolpert;W. G. Macready
Affiliations:
Fraunhofer IPK, Berlin, Germany;-;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2001

Citing 0
Cited 5

Reinterpreting no free lunch

Evolutionary Computation
Conservation of information in search: measuring the cost of success

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Bernoulli's principle of insufficient reason and conservation of information in computer search

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Evolutionary synthesis of nand logic: dissecting a digital organism

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Adaptive Memetic Differential Evolution with Global and Local neighborhood-based mutation operators

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note discusses the recent paper "Some technical remarks on the proof of the no free lunch theorem" by Koppen (2000). In that paper, some technical issues related to the formal proof of the no free lunch (NFL) theorem for search were given by Wolpert and Macready (1995, 1997). The present authors explore the issues raised in that paper including the presentation of a simpler version of the NFL proof in accord with a suggestion made explicitly by Koppen (2000) and implicitly by Wolpert and Macready (1997). They also includes the correction of an incorrect claim made by Koppen (2000) of a limitation of the NFL theorem. Finally, some thoughts on future research directions for research into algorithm performance are given.