Difference between revisions of "Robert Schapire"

From Chessprogramming wiki
Jump to: navigation, search
Line 16: Line 16:
 
* [[Robert Schapire]] ('''1989'''). ''The Strength of Weak Learnability''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/focs/focs89.html FOCS 1989]
 
* [[Robert Schapire]] ('''1989'''). ''The Strength of Weak Learnability''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/focs/focs89.html FOCS 1989]
 
==1990 ...==
 
==1990 ...==
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1990'''). ''A new approach to unsupervised learning in deterministic environments''. [hhttps://dl.acm.org/citation.cfm?id=120048 Machine learning: an artificial intelligence approach volume III], [https://people.csail.mit.edu/rivest/pubs/RS87a.prepub.pdf pdf preprint]
+
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1990'''). ''A new approach to unsupervised learning in deterministic environments''. [https://dl.acm.org/citation.cfm?id=120048 Machine learning: an artificial intelligence approach volume III], [https://people.csail.mit.edu/rivest/pubs/RS87a.prepub.pdf pdf preprint]
 
* [[Robert Schapire]] ('''1990'''). ''The Strength of Weak Learnability''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 5, [https://www.cs.princeton.edu/~schapire/papers/strengthofweak.pdf pdf]
 
* [[Robert Schapire]] ('''1990'''). ''The Strength of Weak Learnability''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 5, [https://www.cs.princeton.edu/~schapire/papers/strengthofweak.pdf pdf]
 
* [[Mathematician#DHHaussler|David Haussler]], [[Mathematician#MKearns|Michael Kearns]], [[Manfred Opper]], [[Robert Schapire]] ('''1991'''). ''[http://papers.nips.cc/paper/489-estimating-average-case-learning-curves-using-bayesian-statistical-physics-and-vc-dimension-methods Estimating Average-Case Learning Curves Using Bayesian, Statistical Physics and VC Dimension Methods]''. [https://dblp.uni-trier.de/db/conf/nips/nips1991.html NIPS 1991]
 
* [[Mathematician#DHHaussler|David Haussler]], [[Mathematician#MKearns|Michael Kearns]], [[Manfred Opper]], [[Robert Schapire]] ('''1991'''). ''[http://papers.nips.cc/paper/489-estimating-average-case-learning-curves-using-bayesian-statistical-physics-and-vc-dimension-methods Estimating Average-Case Learning Curves Using Bayesian, Statistical Physics and VC Dimension Methods]''. [https://dblp.uni-trier.de/db/conf/nips/nips1991.html NIPS 1991]

Revision as of 21:06, 4 March 2019

Home * People * Robert Schapire

Robert Schapire [1] [2]

Robert E. Schapire,
an American mathematician, computer scientist, professor at Princeton University, and since 2014 principal researcher at Microsoft Research [3]. He received his Bachelor degree in mathematics and CS from Brown University in 1986, and his Masters degree and Ph.D. from MIT in 1988 and 1991 respectively, both under the supervision of Ronald L. Rivest [4]. His research interest is in theoretical and applied machine learning, with particular focus on computational statistics, boosting, online learning, game theory, and maximum entropy. On his work in collaboration with Yoav Freund on AdaBoost, an ensemble learning algorithm which is used to combine many "weak" learning machines to create a more robust one, he received the 2003 Gödel prize in theoretical computer science, and the Paris Kanellakis Award in 2004. Further, along with Peter Auer and Nicolò Cesa-Bianchi, Yoav Freund and Robert Schapire worked on multi-armed bandit problems [5].

Selected Publications

[6] [7]

1987 ...

1990 ...

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...

External Links

References

Up one Level