Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,017,625 papers from all fields of science
Search
Sign In
Create Free Account
No free lunch theorem
Known as:
No-free-lunch theorem
In mathematical folklore, the "no free lunch" theorem (sometimes pluralized) of David Wolpert and William Macready appears in the 1997 "No Free Lunch…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Color normalization
Kimeme
Machine learning
No free lunch in search and optimization
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A BENCHMARK OF CONTEMPORARY METAMODELING ALGORITHMS
Can Bogoclu
,
D. Roos
2016
Corpus ID: 67265648
Growing popularity of probabilistic and stochastic optimization methods in engineering applications has vastly increased the…
Expand
2014
2014
Optimizing Without Derivatives: What Does the No Free Lunch Theorem Actually Say?
L. Serafino
2014
Corpus ID: 17688853
One of the most important stages in many areas of engineering and applied sciences is modeling and the use of optimization…
Expand
2012
2012
A Primer on Memetic Algorithms
Ferrante Neri
,
C. Cotta
Handbook of Memetic Algorithms
2012
Corpus ID: 31090330
Memetic Algorithms (MAs) are population-based metaheuristics composed of an evolutionary framework and a set of local search…
Expand
2011
2011
Solving bus terminal location problems using evolutionary algorithms
R. Ghanbari
,
N. Mahdavi-Amiri
Applied Soft Computing
2011
Corpus ID: 43126565
2010
2010
No-Free-Lunch Theorem
Geoffrey I. Webb
,
E. Keogh
,
Risto Miikkulainen
,
Michèle Sebag
Encyclopedia of Machine Learning
2010
Corpus ID: 35176024
1. For a particular algorithm h and a given training set D, the expected error over all two-category problems can be represented…
Expand
2008
2008
A Study of Some Implications of the No Free Lunch Theorem
Andrea Valsecchi
,
L. Vanneschi
EvoWorkshops
2008
Corpus ID: 13227221
We introduce the concept of "minimal" search algorithm for a set of functions to optimize. We investigate the structure of closed…
Expand
2004
2004
Locus Oriented Adaptive Genetic Algorithm: Application to the Zero/One Knapsack Problem
C. Ma
,
K. Szeto
2004
Corpus ID: 28369454
The biological observation of the difference in the mutation rates of allele on different loci is implemented in genetic…
Expand
2003
2003
Recent Results on No-Free-Lunch Theorems for Optimization
C. Igel
,
Marc Toussaint
arXiv.org
2003
Corpus ID: 8779809
The sharpened No-Free-Lunch-theorem (NFL-theorem) states that the performance of all optimization algorithms averaged over any…
Expand
1999
1999
The no free lunch theorem and the human-machine interface
Y. Ho
1999
Corpus ID: 61399987
The no free lunch (NFL) theorem tells us that without any structural assumptions on an optimization problem, no algorithm can…
Expand
1998
1998
Dining with GAs: Operator Lunch Theorems
W. Spears
,
K. A. Jong
Foundations of Genetic Algorithms
1998
Corpus ID: 7288571
There has been considerable discussion of the pros cons of recombination and mutation operators in the context of Holland s…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE