Simple explanation of the no-free-lunch theorem and its implications

被引:361
作者
Ho, YC [1 ]
Pepyne, DL [1 ]
机构
[1] Harvard Univ, Div Engn & Appl Sci, Cambridge, MA 02138 USA
关键词
no-free-lunch theorem; optimization; learning; decision making; search; strategy selection; impossibility theorem; representation and encoding; robustness; sensitivity; complexity;
D O I
10.1023/A:1021251113462
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The no-free-lunch theorem of optimization (NFLT) is an impossibility theorem telling us that a general-purpose, universal optimization strategy is impossible. The only way one strategy can outperform another is if it is specialized to the structure of the specific problem under consideration. Since optimization is a central human activity, an appreciation of the NFLT and its consequences is essential. In this paper, we present a framework for conceptualizing optimization that leads to a simple but rigorous explanation of the NFLT and its implications(4).
引用
收藏
页码:549 / 570
页数:22
相关论文
共 14 条
[1]  
Culberson Jc, 1996, 9618 TR U ALB DEP CO
[2]   On the Futility of Blind Search: An Algorithmic View of "No Free Lunch" [J].
Culberson, Joseph C. .
EVOLUTIONARY COMPUTATION, 1998, 6 (02) :109-127
[3]   Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems [J].
Dai, L .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1996, 91 (02) :363-388
[4]  
DU DZ, 2000, WIL INT S D, P3
[5]  
Hart, 2006, PATTERN CLASSIFICATI
[6]   The no free lunch theorem and the human-machine interface [J].
Ho, YC .
IEEE CONTROL SYSTEMS MAGAZINE, 1999, 19 (03) :8-10
[7]   An explanation of ordinal optimization: Soft computing for hard problems [J].
Ho, YC .
INFORMATION SCIENCES, 1999, 113 (3-4) :169-192
[8]   Remarks on a recent paper on the "No free lunch" theorems [J].
Köppen, M ;
Wolpert, DH ;
Macready, WG .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2001, 5 (03) :295-296
[9]  
LIN XC, 2000, THESIS HARVARD U
[10]  
Radcliffe NJ, 1995, LECT NOTES COMPUT SC, V1000, P275