No free lunch in search and optimization (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "No free lunch in search and optimization" in English language version.

refsWebsite

Global rank English rank

8semanticscholar.org

11^th place

8^th place

7doi.org

2^nd place

3psu.edu

207^th place

136^th place

2nih.gov

4^th place

1ieee.org

652^nd place

515^th place

1byu.edu

1,687^th place

1,074^th place

1york.ac.uk

7,670^th place

5,196^th place

1sites.google.com

626^th place

690^th place

1sciencedirect.com

149^th place

178^th place

1nasa.gov

75^th place

83^rd place

1arxiv.org

69^th place

59^th place

1harvard.edu

18^th place

17^th place

1proquest.com

206^th place

124^th place

1umt.edu

9,893^rd place

6,252^nd place

arxiv.org

Lloyd, S. (2002). "Computational capacity of the universe". Physical Review Letters. 88 (23): 237901–237904. arXiv:quant-ph/0110141. Bibcode:2002PhRvL..88w7901L. doi:10.1103/PhysRevLett.88.237901. PMID 12059399. S2CID 6341263.

byu.edu

dml.cs.byu.edu

Schaffer, Cullen (1994). "A conservation law for generalization performance" (PDF). In Willian, H.; Cohen, W. (eds.). International Conference on Machine Learning. San Francisco: Morgan Kaufmann. pp. 259–265.

doi.org

Wolpert, D. H.; Macready, W. G. (1997). "No Free Lunch Theorems for Optimization". IEEE Transactions on Evolutionary Computation. 1: 67–82. CiteSeerX 10.1.1.138.6606. doi:10.1109/4235.585893. S2CID 5553697.
Wolpert, David (1996). "The Lack of A Priori Distinctions between Learning Algorithms". Neural Computation. Vol. 8. pp. 1341–1390. doi:10.1162/neco.1996.8.7.1341. S2CID 207609360.
English, T. M. (2000). "Optimization is easy and learning is hard in the typical function". Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512). Vol. 2. pp. 924–931. doi:10.1109/CEC.2000.870741. ISBN 0-7803-6375-2. S2CID 11295575.
Lloyd, S. (2002). "Computational capacity of the universe". Physical Review Letters. 88 (23): 237901–237904. arXiv:quant-ph/0110141. Bibcode:2002PhRvL..88w7901L. doi:10.1103/PhysRevLett.88.237901. PMID 12059399. S2CID 6341263.
Rowe; Vose; Wright (2009). "Reinterpreting No Free Lunch". Evolutionary Computation. 17 (1): 117–129. doi:10.1162/evco.2009.17.1.117. PMID 19207090. S2CID 6251842.
Ho, Y. C.; Pepyne, D. L. (2002). "Simple Explanation of the No-Free-Lunch Theorem and Its Implications". Journal of Optimization Theory and Applications. 115 (3): 549–570. doi:10.1023/A:1021251113462. S2CID 123041865.
Wolpert, D. H. (2023). "The Implications of the No-Free-Lunch Theorems for Meta-induction". Journal for General Philosophy of Science. 1: 67–82. doi:10.1109/4235.585893. S2CID 5553697.

harvard.edu

ui.adsabs.harvard.edu

Lloyd, S. (2002). "Computational capacity of the universe". Physical Review Letters. 88 (23): 237901–237904. arXiv:quant-ph/0110141. Bibcode:2002PhRvL..88w7901L. doi:10.1103/PhysRevLett.88.237901. PMID 12059399. S2CID 6341263.

ieee.org

ieeexplore.ieee.org

Wolpert, D. H.; Macready, W. G. (1997). "No Free Lunch Theorems for Optimization". IEEE Transactions on Evolutionary Computation. 1: 67–82. CiteSeerX 10.1.1.138.6606. doi:10.1109/4235.585893. S2CID 5553697.

nasa.gov

ntrs.nasa.gov

Wolpert, D.H., and Macready, W.G. (2005) "Coevolutionary free lunches," IEEE Transactions on Evolutionary Computation, 9(6): 721–735

nih.gov

pubmed.ncbi.nlm.nih.gov

Lloyd, S. (2002). "Computational capacity of the universe". Physical Review Letters. 88 (23): 237901–237904. arXiv:quant-ph/0110141. Bibcode:2002PhRvL..88w7901L. doi:10.1103/PhysRevLett.88.237901. PMID 12059399. S2CID 6341263.
Rowe; Vose; Wright (2009). "Reinterpreting No Free Lunch". Evolutionary Computation. 17 (1): 117–129. doi:10.1162/evco.2009.17.1.117. PMID 19207090. S2CID 6251842.

proquest.com

search.proquest.com

The "only if" part was first published by Schumacher, C. W. (2000). Black Box Search : Framework and Methods (PhD dissertation). The University of Tennessee, Knoxville. ProQuest 304620040.

psu.edu

citeseerx.ist.psu.edu

Wolpert, D. H.; Macready, W. G. (1997). "No Free Lunch Theorems for Optimization". IEEE Transactions on Evolutionary Computation. 1: 67–82. CiteSeerX 10.1.1.138.6606. doi:10.1109/4235.585893. S2CID 5553697.
Igel, C., and Toussaint, M. (2004) "A No-Free-Lunch Theorem for Non-Uniform Distributions of Target Functions," Journal of Mathematical Modelling and Algorithms 3, pp. 313–322.
Woodward, John R. (2009). "Computable and incomputable functions and search algorithms". IEEE International Conference on Intelligent Computing and Intelligent Systems, 2009. Vol. 1. IEEE. pp. 871–875. CiteSeerX 10.1.1.158.7782.

sciencedirect.com

S. Droste, T. Jansen, and I. Wegener. 2002. "Optimization with randomized search heuristics: the (A)NFL theorem, realistic scenarios, and difficult functions," Theoretical Computer Science, vol. 287, no. 1, pp. 131–144.

semanticscholar.org

api.semanticscholar.org

Wolpert, D. H.; Macready, W. G. (1995). "No Free Lunch Theorems for Search". Technical Report SFI-TR-95-02-010. Santa Fe Institute. S2CID 12890367.
Wolpert, D. H.; Macready, W. G. (1997). "No Free Lunch Theorems for Optimization". IEEE Transactions on Evolutionary Computation. 1: 67–82. CiteSeerX 10.1.1.138.6606. doi:10.1109/4235.585893. S2CID 5553697.
Wolpert, David (1996). "The Lack of A Priori Distinctions between Learning Algorithms". Neural Computation. Vol. 8. pp. 1341–1390. doi:10.1162/neco.1996.8.7.1341. S2CID 207609360.
English, T. M. (2000). "Optimization is easy and learning is hard in the typical function". Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512). Vol. 2. pp. 924–931. doi:10.1109/CEC.2000.870741. ISBN 0-7803-6375-2. S2CID 11295575.
Lloyd, S. (2002). "Computational capacity of the universe". Physical Review Letters. 88 (23): 237901–237904. arXiv:quant-ph/0110141. Bibcode:2002PhRvL..88w7901L. doi:10.1103/PhysRevLett.88.237901. PMID 12059399. S2CID 6341263.
Rowe; Vose; Wright (2009). "Reinterpreting No Free Lunch". Evolutionary Computation. 17 (1): 117–129. doi:10.1162/evco.2009.17.1.117. PMID 19207090. S2CID 6251842.
Ho, Y. C.; Pepyne, D. L. (2002). "Simple Explanation of the No-Free-Lunch Theorem and Its Implications". Journal of Optimization Theory and Applications. 115 (3): 549–570. doi:10.1023/A:1021251113462. S2CID 123041865.
Wolpert, D. H. (2023). "The Implications of the No-Free-Lunch Theorems for Meta-induction". Journal for General Philosophy of Science. 1: 67–82. doi:10.1109/4235.585893. S2CID 5553697.

sites.google.com

English, T. (2004) No More Lunch: Analysis of Sequential Search, Proceedings of the 2004 IEEE Congress on Evolutionary Computation, pp. 227–234.

umt.edu

scholarworks.umt.edu

Rowe; Vose; Wright (2009). "Reinterpreting No Free Lunch". Evolutionary Computation. 17 (1): 117–129. doi:10.1162/evco.2009.17.1.117. PMID 19207090. S2CID 6251842.

york.ac.uk

cs.york.ac.uk

Streeter, M. (2003) "Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold," Genetic and Evolutionary Computation – GECCO 2003, pp. 1418–1430.