# On Classes of Functions for which No Free Lunch Results Hold

@article{Igel2003OnCO, title={On Classes of Functions for which No Free Lunch Results Hold}, author={Christian Igel and Marc Toussaint}, journal={ArXiv}, year={2003}, volume={cs.NE/0108011} }

The No Free Lunch (NFL) theorems for combinatorial optimization state, roughly speaking, that all search algorithms have the same average performance over all possible objective functions f : X → Y, where the search space X as well as the cost-value space Y are finite sets [6]. However, it has been argued that in practice one does not need an algorithm that performs well on all possible functions, but only on a subset that arises from the constraints of real-world problems. For example, it has… Expand

#### Figures and Topics from this paper

#### 113 Citations

Recent Results on No-Free-Lunch Theorems for Optimization

- Computer Science, Mathematics
- ArXiv
- 2003

The sharpened No-Free-Lunch-theorem (NFL-theorem) states that the performance of all optimization algorithms averaged over any finite set F of functions is equal if and only if F is closed under… Expand

A No-Free-Lunch theorem for non-uniform distributions of target functions

- Computer Science
- J. Math. Model. Algorithms
- 2004

The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the performance measure, the performance of all optimization algorithms averaged uniformly over any finite set F of… Expand

A No-Free-Lunch Theorem for Non-Uniform Distributions of Target Functions

- Mathematics
- 2004

The sharpened No-Free-Lunch-theorem (NFL-theorem) states that, regardless of the performance measure, the performance of all optimization algorithms averaged uniformly over any finite set F of… Expand

A Study of Some Implications of the No Free Lunch Theorem

- Computer Science
- EvoWorkshops
- 2008

It is proved that each set of functions based on the distance to a given optimal solution, among which trap functions, onemax or the recently introduced onemix functions, and the NK-landscapes are not c.u.p. and thus the thesis of the sharpened No Free Lunch Theorem does not hold for them. Expand

No-Free-Lunch theorems and the diversity of algorithms

- Computer Science
- Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
- 2004

In this paper, the no-free-lunch theorem is extended to subsets of functions. It is shown that for algorithm a performing better on a set of functions than algorithm b, three has to be another subset… Expand

No-Free-Lunch theorems and the diversity of algorithms

- Mathematics, Computer Science
- 2004

In this paper, the no-free-lunch theorem is extended to subsets of functions. It is shown that for algorithm a performing better on a set of functions than algorithm b, three has to be another subset… Expand

Analysing the significance of no free lunch theorems on the set of real-world binary problems

- Computer Science, Mathematics
- 2011 11th International Conference on Intelligent Systems Design and Applications
- 2011

This work first assumes that binary problems appearing in the literature are representative of the set of real-world binary problems, and analyses the mean performance of several algorithms on subsets of this well-defined testbed, in particular, static combinatorial unconstrained single-objective single-player optimisation problems whose solutions can be directly encoded as arrays of binary variables. Expand

No Free Lunch and Algorithmic Randomness

- 2006

Schumacher, Vose & Whitley [1] have shown that Wolpert & MacReady’s celebrated No Free Lunch theorem [2] applies only to classes of target functions which are closed under permutation (c.u.p.). In… Expand

Conditions that Obviate the No-Free-Lunch Theorems for Optimization

- Mathematics, Computer Science
- INFORMS J. Comput.
- 2007

This paper looks more closely at the NFL results and focuses on their implications for combinatorial problems typically faced by many researchers and practitioners, finding that only trivial subclasses of these problems fall under the NFL implications. Expand

Optimization, block designs and No Free Lunch theorems

- Mathematics, Computer Science
- Inf. Process. Lett.
- 2005

This work provides tight connections between such ''No Free Lunch'' conditions and the structure of t-designs and t-wise balanced designs for arbitrary values t, and obtains a nontrivial family of n-variate Boolean functions that satisfies the '' no-free-lunch'' condition with respect to searches of length @W(n^1^/^2/log^1+2n). Expand

#### References

SHOWING 1-10 OF 14 REFERENCES

Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2002

An Almost No Free Lunch (ANFL) theorem shows that for each function which can be optimized efficiently by a search heuristic there can be constructed many related functions where the same heuristic is bad. Expand

No free lunch theorems for optimization

- Mathematics, Computer Science
- IEEE Trans. Evol. Comput.
- 1997

A framework is developed to explore the connection between effective optimization algorithms and the problems they are solving. A number of "no free lunch" (NFL) theorems are presented which… Expand

Perhaps Not a Free Lunch But At Least a Free Appetizer

- Mathematics, Computer Science
- GECCO
- 1999

It is argued why the scenario on which the No Free Lunch Theorem is based does not model real life optimization, and why optimization techniques differ in their efficiency. Expand

The No Free Lunch and problem description length

- Mathematics
- 2001

The No Free Lunch theorem is reviewed and cast within a simple framework for black-box search. A duality result which relates functions being optimized to algorithms optimizing them is obtained and… Expand

A Free Lunch Proof for Gray versus Binary Encodings

- 1999

A measure of complexity is proposed that counts the number of local minima in any given problem representation. A special class of functions with the maximum possible number of optima is also deened.… Expand

The No Free Lun and description length

- in: L. Spector, E. Goodman, A. W W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo S. Pezeshk, M. Garzon, E. Burke (Eds.), Genetic and Evolut ary Computation Conference
- 2001

The No Free Lunch and description length

- Genetic and Evolutionary Computation Conference
- 2001

Perhaps not a Free Lunc at least a free appetizer

- in: W. Banzhaf, J. Daida, A. Eib M.H. Garzon, V. Honovar, M. Jakiela, R.E. Smith (Eds Proceedings of the Genetic and Evolutionary Computa Conference (GECCO’99), Orlando, FL, Morgan Kaufmann, S Francisco, CA
- 1999

An Introduction to Probability Theory and i Applications, Vol. I, 3rd edn

- 1971