Continuous lunches are free!

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 916-922

  Auger, Anne ^a   Teytaud, Olivier ^a  

^a INRIA   (France)

Author keywords

Free lunch; Kolmogorov's extension theorem; No free lunch

Indexed keywords

PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

CONTINUOUS DOMAINS; FREE-LUNCH THEOREM; KOLMOGOROV'S EXTENSION THEOREM; NO FREE LUNCH (NFL) THEOREMS;

HEURISTIC ALGORITHMS;

EID: 34548087350     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277145     Document Type: Conference Paper

References (13)

1. P. Billingsley. Probability and Measure. John Wiley and Sons, 1986.
2. D. Corne and J. Knowles. Some multiobjective optimizers are better than others. In IEEE Congress on Evolutionary Computation, 2003.
3. J. C. Culberson. On the futility of blind search: an algorithmic view of "No Free Lunch". Evolutionary Computation, 6(2):109-127, 1998.
4. P. J. Daniell. Integrals in an infinite number of dimensions. Annals of Mathematics, 20:281-88, 1919.
5. J. Doob. Stochastic process measurability conditions. Ann. Inst. Fourier, Grenoble, 25(3 and 4):163-176, 1975.
6. S. Droste, T. Jansen, and I. Wegener. Perhaps Not a Free Lunch But At Least a Free Appetizer. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of theFirstGenetic and Evolutionary Computation Conference(GECCO '99), pages 833-839, San Francisco CA, 13-17 1999. Morgan Kaufmann Publishers, Inc.
7. S. Droste, T. Jansen, and I. Wegener. Optimization with randomized search heuristics - The (A)NFL theorem, realistic scenarios, and difficult functions. Theoretical Computer Science, 287(1):131-144, 2002.
8. C. Igel and M. Toussaint. A No-Free-Lunch Theorem for Non-Uniform Distributions of Target Functions. Journal of Mathematical Modelling and Algorithms, 3(4):313-322, 2004.
9. A. Kolmogorov. Foundations of the theory of Probability (original: Grundbegriffe der Wahrscheinlichkeitsrechnung). Chelsea publishing company, New-York, (1933 original), 1956.
10. N. Radcliffe and P. Surry. Fundamental limitations on search algorithms: Evolutionary computing in perspective. In J. van Leeuwen, editor, Lecture Notes in Computer Science, Berlin, Germany, 1995. Springer.
11. C. Schumacher, M. D. Vose, and L. D. Whitley. The No Free Lunch and Problem Description Length. In L. Spector, E. Goodman, A. Wu, W. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.Garzon, and E. Burke, editors, Genetic and Evolutionary Computation Conference (GECCO 2001), pages 565-570, San Francisco, CA, USA, 2001.
12. E. VanMarcke. Random Fields: Analysis and Synthesis. MIT Press, Cambridge MA, 1998.
13. D. Wolpert and W. Macready. No Free Lunch Theorems for optimization. IEEE Transactions in Evolutionary Computation, 1(1):67-82, 1997.