ML Anthology

No Free Lunch Theorems for Optimization

David H. Wolpert, William G. Macready
Notable Works 1997 pp. 67-82
doi:10.1109/4235.585893 /misc/1997/wolpert1997misc-no/

Abstract

A number of no free lunch theorems are presented which establish that for any algorithm, any elevated performance over one class of problems is offset by performance over another class.

PDF Semantic Scholar

Cite

Text

Wolpert and Macready. "No Free Lunch Theorems for Optimization." IEEE Transactions on Evolutionary Computation, 1997. doi:10.1109/4235.585893

Markdown

[Wolpert and Macready. "No Free Lunch Theorems for Optimization." IEEE Transactions on Evolutionary Computation, 1997.](https://mlanthology.org/misc/1997/wolpert1997misc-no/) doi:10.1109/4235.585893

BibTeX

@misc{wolpert1997misc-no,
  title     = {{No Free Lunch Theorems for Optimization}},
  author    = {Wolpert, David H. and Macready, William G.},
  howpublished = {IEEE Transactions on Evolutionary Computation},
  year      = {1997},
  pages     = {67-82},
  doi       = {10.1109/4235.585893},
  volume    = {1},
  number    = {1},
  url       = {https://mlanthology.org/misc/1997/wolpert1997misc-no/}
}