**No Free Lunch In Search And Optimization**

In computing, there are circumstances in which the outputs of all procedures solving a particular type of problem are statistically identical. A colorful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that **there is no free lunch**. Wolpert had previously derived no free lunch theorems for machine learning (statistical inference). Before Wolpert's article was published, Cullen Schaffer had summarized a preprint version of this work of Wolpert's, but used different terminology.

In the "no free lunch" metaphor, each "restaurant" (problem-solving procedure) has a "menu" associating each "lunch plate" (problem) with a "price" (the performance of the procedure in solving the problem). The menus of restaurants are identical except in one regard – the prices are shuffled from one restaurant to the next. For an omnivore who is as likely to order each plate as any other, the average cost of lunch does not depend on the choice of restaurant. But a vegan who goes to lunch regularly with a carnivore who seeks economy pays a high average cost for lunch. To methodically reduce the average cost, one must use advance knowledge of a) what one will order and b) what the order will cost at various restaurants. That is, improvement of performance in problem-solving hinges on using prior information to match procedures to problems.

In formal terms, there is no free lunch when the probability distribution on problem instances is such that all problem solvers have identically distributed results. In the case of search, a problem instance is an objective function, and a result is a sequence of values obtained in evaluation of candidate solutions in the domain of the function. For typical interpretations of results, search is an optimization process. There is no free lunch in search if and only if the distribution on objective functions is invariant under permutation of the space of candidate solutions. This condition does not hold precisely in practice, but an "(almost) no free lunch" theorem suggests that it holds approximately.

Read more about No Free Lunch In Search And Optimization: Overview, No Free Lunch (NFL), Formal Synopsis of NFL, Original NFL Theorems, Interpretations of NFL Results, Coevolutionary Free Lunches

### Other articles related to "no free lunch in search and optimization":

**No Free Lunch In Search And Optimization**- Coevolutionary Free Lunches

... Wolpert and Macready have proved that there are free lunches in coevolutionary optimization ... Their analysis "covers 'self-play' problems ...

### Famous quotes containing the words search, lunch and/or free:

“The *search* for happiness is one of the chief sources of unhappiness.”

—Eric Hoffer (1902–1983)

“Long as there’s *lunch* counters, you can always find work.”

—Mother and Aunts Of Dorothy Allison, U.S. waitresses. As quoted in Skin, ch. 2, by Dorothy Allison (1994)

“The atmosphere parents wish to create when talking with children about birth and reproduction is warm, honest, and reassuring, one that tells children they are *free* to ask questions as often as they need to, and you will answer them as lovingly as you know how.”

—Joanna Cole (20th century)