The No Free Lunch and problem description length

177 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

An analysis of particle swarm optimizers (2002, background): “A more constructive approach is to try and characterise the set of functions over which the NFL does not hold.”
Metaheuristic design of feedforward neural networks: A review of two decades of research (2017, background): “[94] argue that the NFL theorem [91] holds only for the set of problems which are closed under permutation (c.”
Bio-inspired computation: Where we stand and what's next (2019, background): “Indeed, the lack of a universally outperforming meta-heuristic for all kind of optimization problems yields from the well-known No Free Lunch Theorem for optimization, originally introduced in [47], further elaborated in [48, 49, 50, 51], and recently revisited in [52].”