Loading AI tools
American mathematician, physicist and computer scientist From Wikipedia, the free encyclopedia
David Hilton Wolpert is an American physicist and computer scientist. He is a professor at Santa Fe Institute. He is the author of three books, three patents, over one hundred refereed papers, and has received two awards. His name is particularly associated with a theorem in computer science known as "no free lunch".
David H. Wolpert | |
---|---|
Nationality | American |
Alma mater | Princeton University University of California, Santa Barbara |
Scientific career | |
Fields | Mathematics Computer science |
Institutions | Santa Fe Institute |
Doctoral advisor | Anthony Zee |
David Wolpert took a B.A. in physics at Princeton University (1984), then attended the University of California, Santa Barbara, where he took the degrees of M.A. (1987) and Ph.D. (1989).
Between 1989 and 1997 he pursued a research career at Los Alamos National Laboratory, IBM, TXN Inc. and Santa Fe Institute.
From 1997 to 2011 he worked as senior computer scientist at NASA Ames Research Center, and became visiting scholar at the Max Planck Institute. He spent the year 2010-11 as Ulam Scholar at the Center for Nonlinear Studies at Los Alamos.[1]
He joined the faculty of Santa Fe Institute in 2011 and became a professor there in September 2013.[2] His research interests have included statistics, game theory, machine learning applications, information theory, optimization methods and complex systems theory.
One of Wolpert's most discussed achievements is known as No free lunch in search and optimization.[3][4][5][6] By this theorem, all algorithms for search and optimization perform equally well averaged over all problems in the class with which they are designed to deal. However, in a machine learning context, the theorem makes an implicit artificial assumption regarding the lack of overlap between training and test data that is rarely true in practice.[7] More generally, the theorem holds only under certain conditions that are not often encountered precisely in real life,[8][9][10] although it has been claimed that the conditions can be met approximately.[11] The theorem lies within the domain of computer science, but a weaker version known as the “folkloric no free lunch theorem” has been drawn upon by William A. Dembski in support of intelligent design.[12] This use of the theorem has been rejected by Wolpert himself[13] and others.[14][15]
Wolpert has formalized an argument to show that it is in principle impossible for any intellect to know everything about the universe of which it forms a part, in other words disproving "Laplace's demon".[16] This has been seen as an extension of the limitative theorems of the twentieth century such as those of Heisenberg and Gödel.[17] In 2018 Wolpert published a proof revealing the fundamental limits of scientific knowledge.[18]
Wolpert made many contributions to the early work on machine learning. These include a Bayesian estimator of the entropy of a distribution based on samples of the distribution,[19][20] disproving formal claims that the "evidence procedure" is equivalent to hierarchical Bayes,[21] a Bayesian alternative to the chi-squared test,[22] a proof that there is no prior for which the bootstrap procedure is Bayes-optimal,[23] and Bayesian extensions of the bias-plus-variance decomposition.[24] Most prominently, he introduced "stacked generalization",[25] a more sophisticated version of cross-validation that uses held-in / held-out partitions of a data set to combine learning algorithms rather than just choose one of them. This work was developed further by Breiman, Smyth, Clarke and many others, and in particular the top two winners of 2009 Netflix competition made use of stacked generalization (rebranded as "blending").[26]