2001 · 136 citations · 4 references
ComputingComputer ScienceMathematicsAlgorithmsOptimizationTheory Of ComputationAlgorithm AnalysisCombinatorial OptimizationComputational ComplexityHeuristic SearchOptimization TheorySearching AlgorithmsMinimum Description LengthSearch Problems
The No Free Lunch theorem is reviewed and cast within a simple framework for blackbox search. A duality result which relates functions being optimized to algorithms optimizing them is obtained and is used to sharpen the No Free Lunch theorem. Observations are made concerning problem description length within the context provided by the results of this paper. It is seen that No Free Lunch results are independent from whether or not the set of functions (over which a No Free Lunch result holds) is compressible.
4
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
No Free Lunch Theorems for Search
David H. Wolpert, William G. Macready · RePEc: Research Papers in Economics · 1995 · 930 citations