No free lunch and benchmarks

Evolutionary Computation

Volumn 21, Issue 2, 2013, Pages 293-312

  Duéñez Guzmán, Edgar A ^a   Vose, Michael D ^b  

^a HARVARD UNIVERSITY   (United States)

^b University of Tennessee Knoxville   (United States)

Author keywords

Benchmarks; Black box search; Minimax; No free lunch; Optimization

Indexed keywords

ALGORITHMS; OPTIMIZATION;

BASIC RESULTS; BLACK BOXES; MINIMAX; NO FREE LUNCH; PERFORMANCE MATCHING; PERFORMANCE MEASURE; SEARCH ALGORITHMS;

BENCHMARKING;

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER PROGRAM; EVOLUTION; METHODOLOGY; PROBABILITY;

ALGORITHMS; BIOLOGICAL EVOLUTION; COMPUTATIONAL BIOLOGY; PROBABILITY; SOFTWARE;

EID: 84887634669     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00077     Document Type: Article

References (26)

1. Allibone, S. A. (1879). Prose quotations from Socrates to Macaulay. Reprint Services Corp.
2. 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.
3. Auger, A., and Teytaud, O. (2010). Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica, 57:121-146.
4. Corne, D., and Knowles, J. (2003). No free lunch and free leftovers theorems for multiobjective optimisation problems. In Evolutionary multi-criterion optimization. Lecture notes in computer science, Vol. 2632 (pp. 327-341). Berlin: Springer.
5. Domingos, P. (1998). How to get a free lunch: A simple cost model for machine learning applications. Proceedings of the AAAI98/ICML98, Workshop on the Methodology of Applying Machine Learning, pp. 1-7.
6. 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-1999, pp. 833-839.
7. Droste, S., Jansen, T., and Wegener, I. (2002). Optimization with randomized search heuristics-The (a)nfl theorem, realistic scenarios, and difficult functions. Theoretical Computer Science, 287:131-144.
8. Goldberg, D. (1989). Genetic algorithm in search, optimization and machine learning. Reading, MA: Addison-Wesley.
9. Griffiths, E., and Orponen, P. (2005). Optimization, block designs and no free lunch theorems. Information Processing Letters, 94:55-61.
10. Haupt, R., and Haupt, S. (2004). Practical genetic algorithms, 2nd ed. New York: Wiley.
11. Holland, J. (1975). Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor.
12. Igel, C., and Toussaint, M. (2001). On classes of functions for which no free lunch results hold. Retrieved from CoRR cs. NE-0108011
13. Igel, C., and Toussaint, M. (2004). A no-free-lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modeling and Algorithms, 3(4):313-322.
14. Mitchell, M. (1998). An introduction to genetic algorithms, 3rd ed. Cambridge, MA: MIT Press.
15. Radcliffe, N., and Surry, P. (1995). Fundamental limitations on search algorithms: Evolutionary computing in perspective. In van Leeuwen, J. (Ed.), Computer science today. Lecture notes in computer science, Vol. 1000 (pp. 275-291). Berlin: Springer.
16. Roberts, A., and Varberg, D. (1973). Convex functions. New York: Academic Press.
17. Rowe, J., and Vose, M. (2011). Unbiased black box search algorithms. In N. Krasnogor (Ed.), Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, pp. 2035-2042.
18. Rowe, J., Vose, M., and Wright, A. (2009). Reinterpreting no free lunch. Evolutionary Computation, 17:117-129.
19. Schumacher, C. (2000). Black box search-Framework and methods. PhD thesis, The University of Tennesee, Knoxville.
20. Streeter, M. (2003). Two broad classes of functions for which a no free lunch result does not hold. In Genetic and evolutionary computation, GECCO 2003. Lecture notes in computer science, Vol. 2724 (pp. 1418-1430). Berlin: Springer.
21. Wardetzky, M., Mathur, S., Kalberer, F., and Grinspun, E. (2007). Discrete Laplace operators: No free lunch. In A. Belyaev and M. Garland (Eds.), Eurographics Symposium on Geometry Processing, pp. 33-37.
22. Whitley, D., and Rowe, J. (2008). Focused no free lunch theorems. Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO-2008, pp. 811-818.
23. Wolpert, D. (2001). The supervised learning no-free-lunch theorems. In Proceedings of the 6th Online World Conference on Soft Computing in Industrial Applications, pp. 25-42.
24. Wolpert, D., and Macready, M. (1995). No free lunch theorems for search. (SFI-TR-95-02-010)
25. Wolpert, D., and Macready, M. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1):67-82.
26. Woodward, J., and Neil, J. (2003). No free lunch, program induction and combinatorial problems. In Genetic programming. Lecture notes in computer science, Vol. 2610 (pp. 287-313). Berlin: Springer.