Reinterpreting no free lunch

Evolutionary Computation

Volumn 17, Issue 1, 2009, Pages 117-129

  Rowe, Jon E ^a   Vose, M D ^b   Wright, Alden H ^c  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b University of Tennessee Knoxville   (United States)

^c UNIVERSITY OF MONTANA   (United States)

Author keywords

Black Box Search; No free lunch

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER LANGUAGE; LANGUAGE; MATHEMATICAL COMPUTING; METHODOLOGY; PROBABILITY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; IMAGE INTERPRETATION, COMPUTER-ASSISTED; LANGUAGE; MATHEMATICAL COMPUTING; PATTERN RECOGNITION, AUTOMATED; PROBABILITY; PROGRAMMING LANGUAGES;

EID: 62249099175     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2009.17.1.117     Document Type: Article

References (11)

1. Auger, A., and Teytaud, O. (2007). Continuous lunches are free! Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO-2007, pp. 916-922. New York: ACM Press.
2. Devlin, K. (1994). The joy of sets: Fundamentals of contemporary set theory. Berlin: Springer.
3. Droste, S., Jansen, T., and Wegener, I. (1999). Perhaps not a free lunch but at least a free appetizer. Proceedings of the First Genetic and Evolutionary Computation Conference (GECCO '99), pp. 833-839. San Mateo, CA: Morgan Kaufmann.
4. Hewitt, E., and Stromberg, K. (1965). Real and abstract analysis. Berlin: Springer.
5. Igel, C., and Toussaint, M. (2004). A no-free-lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modelling and Algorithms, 3(4):313-322.
6. Köppen, M. (2000). Some technical remarks on the proof of the no free lunch theorem. Proceedings of the Joint Conference on Information Sciences (JCIS 2000), pp. 1020-1024.
7. Köppen, M., Wolpert, D., and Macready, M. (2001). Remarks on a recent paper on the "no free lunch" theorems. IEEE Transactions on Evolutionary Computation, 5(3):295-296.
8. Radcliffe, N., and Surry, P. (1995). Fundamental limitations on search algorithms: Evolutionary computing in perspective. Computer Science Today, pp. 275-291.
9. Schumacher, C. (2000). Black box search-Framework and methods. PhD thesis, The University of Tennessee, Knoxville.
10. Wolpert, D., and Macready, M. (1995). No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute.
11. Wolpert, D., and Macready, M. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, l(l):67-82.