25,161
edits
Changes
Created page with "'''Home * People * Robert Schapire''' FILE:RobertSchapire.jpg|border|right|thumb|link=https://www.icmla-conference.org/icmla09/| Robert Schapire <ref>[ht..."
'''[[Main Page|Home]] * [[People]] * Robert Schapire'''
[[FILE:RobertSchapire.jpg|border|right|thumb|link=https://www.icmla-conference.org/icmla09/| Robert Schapire <ref>[http://www.icmla-conference.org/icmla09/ ICMLA 2009 - Invited Speakers]</ref> <ref>[http://videolectures.net/robert_schapire/ Robert Schapire - Department of Computer Science, Princeton University - VideoLectures.NET]</ref> ]]
'''Robert E. Schapire''',<br/>
an American mathematician, computer scientist, professor at [https://en.wikipedia.org/wiki/Princeton_University Princeton University], and since 2014 principal researcher at [[Microsoft]] [https://en.wikipedia.org/wiki/Microsoft_Research Research] <ref>[https://www.microsoft.com/en-us/research/people/schapire/ Robert Schapire - Microsoft Research]</ref>.
He received his Bachelor degree in mathematics and CS from [https://en.wikipedia.org/wiki/Brown_University Brown University] in 1986, and his Masters degree and Ph.D. from [[Massachusetts Institute of Technology|MIT]] in 1988 and 1991 respectively, both under the supervision of [[Ronald L. Rivest]] <ref>[https://www.icmla-conference.org/icmla09/ ICMLA 2009 - Invited Speakers]</ref>.
His research interest is in theoretical and applied [[Learning|machine learning]], with particular focus on [https://en.wikipedia.org/wiki/Computational_statistics computational statistics], [https://en.wikipedia.org/wiki/Boosting_%28machine_learning%29 boosting], [https://en.wikipedia.org/wiki/Online_machine_learning online learning], [https://en.wikipedia.org/wiki/Game_theory game theory], and [https://en.wikipedia.org/wiki/Principle_of_maximum_entropy maximum entropy].
On his work in collaboration with [[Yoav Freund]] on [https://en.wikipedia.org/wiki/AdaBoost AdaBoost], an [https://en.wikipedia.org/wiki/Ensemble_learning ensemble learning] algorithm which is used to combine many "weak" learning machines to create a more robust one, he received the 2003 [https://en.wikipedia.org/wiki/G%C3%B6del_Prize Gödel prize] in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science], and the [https://en.wikipedia.org/wiki/Paris_Kanellakis_Award Paris Kanellakis Award] in 2004. Further, along with [[Peter Auer]] and [[Nicolò Cesa-Bianchi]], Yoav Freund and Robert Schapire worked on [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit problems] <ref>[[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html NeuroCOLT2], [http://www.dklevine.com/archive/refs4462.pdf pdf]</ref>.
=Selected Publications=
<ref>[https://www.cs.princeton.edu/~schapire/publist.html Robert Schapire - Publication list]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/s/Schapire:Robert_E= dblp: Robert E. Schapire]</ref>
==1987 ...==
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1987'''). ''Diversity-Based Inference of Finite Automata''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/focs/focs87.html FOCS 1987], [https://people.csail.mit.edu/rivest/pubs/RS87c.pdf pdf]
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1989'''). ''Inference of Finite Automata Using Homing Sequences''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/stoc/stoc89.html STOC 1989], [https://people.csail.mit.edu/rivest/RivestSchapire-InferenceOfFiniteAutomataUsingHomingSequences-STOC89.pdf pdf]
* [[Robert Schapire]] ('''1989'''). ''The Strength of Weak Learnability''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/focs/focs89.html FOCS 1989]
==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]
* [[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]
* [[Robert Schapire]] ('''1991'''). ''The Design and Analysis of Efficient Learning Algorithms''. Ph.D. thesis, [[Massachusetts Institute of Technology|MIT]], supervisor [[Ronald L. Rivest]], [https://apps.dtic.mil/dtic/tr/fulltext/u2/a231888.pdf pdf]
* [[Robert Schapire]] ('''1992'''). ''[https://dl.acm.org/citation.cfm?id=136314 The Design and Analysis of Efficient Learning Algorithms]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press], (ACM Doctoral Dissertation Award), [https://www.amazon.com/Analysis-Efficient-Learning-Algorithms-Dissertation/dp/0262193256 amazon]
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1994'''). ''Diversity-Based Inference of Finite Automata''. [[ACM#Journal|Journal of the ACM]], Vol. 41, No. 3, [https://www.cs.princeton.edu/~schapire/papers/diversity-based-inference.pdf pdf]
==1995 ...==
* [[Yoav Freund]], [[Robert Schapire]] ('''1996'''). ''Game Theory, On-line Prediction and Boosting''. [https://dblp.uni-trier.de/db/conf/colt/colt1996.html COLT 1996], [http://www.cs.princeton.edu/~schapire/papers/FreundSc96b.pdf pdf]
* [[Robert Schapire]], [[Mathematician#MKWarmuth|Manfred K. Warmuth]] ('''1996'''). ''On the Worst-Case Analysis of Temporal-Difference Learning Algorithms''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 22, Nos. 1-3, [https://users.soe.ucsc.edu/~manfred/pubs/J34.pdf pdf]
* [[Yoav Freund]], [[Robert Schapire]] ('''1997'''). ''A decision-theoretic generalization of on-line learning and an application to boosting''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 55, No. 1, [http://cseweb.ucsd.edu/~yfreund/papers/adaboost.pdf 1996 pdf] » [https://en.wikipedia.org/wiki/AdaBoost AdaBoost]
* [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Mathematician#DPHelmbold|David P. Helmbold]], [[Mathematician#DHHaussler|David Haussler]], [[Robert Schapire]], [[Mathematician#MKWarmuth|Manfred K. Warmuth]] ('''1997'''). ''How to Use Expert Advice''. [[ACM#Journal|Journal of the ACM]], Vol. 44, No. 3, [http://homes.di.unimi.it/cesa-bianchi/Pubblicazioni/jacm-97a.pdf pdf]
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html NeuroCOLT2], [http://www.dklevine.com/archive/refs4462.pdf pdf]
* [[Robert Schapire]], [[Yoav Freund]], [[Peter Bartlett]], [[Wee Sun Lee]] ('''1998'''). ''Boosting the margin: A new explanation for the effectiveness of voting methods''. [https://en.wikipedia.org/wiki/Annals_of_Statistics Annals of Statistic], [http://www.cc.gatech.edu/~isbell/tutorials/boostingmargins.pdf pdf]
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''Adaptive game playing using multiplicative weights''. [https://en.wikipedia.org/wiki/Games_and_Economic_Behavior Games and Economic Behavior], Vol. 29, [http://cseweb.ucsd.edu/~yfreund/papers/games_long.pdf pdf]
* [[Robert Schapire]] ('''1999'''). ''[https://dl.acm.org/citation.cfm?id=1624417 A Brief Introduction to Boosting]''. [[Conferences#IJCAI1999|IJCAI 1999]], [https://www.ijcai.org/Proceedings/99-2/Papers/103.pdf pdf]
* [[Robert Schapire]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007%2F3-540-46769-6_2 Theoretical Views of Boosting and Applications]''. [https://dblp.uni-trier.de/db/conf/alt/alt1999.html ALT 1999], [http://www-ai.cs.uni-dortmund.de/LEHRE/PG/PG445/literatur/schapire_99a.pdf pdf]
* [[Robert Schapire]] ('''1999'''). ''Drifting Games''. [https://dblp.uni-trier.de/db/conf/colt/colt1999.html COLT 1999], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.1290 CiteSeerX]
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''[https://link.springer.com/article/10.1023%2FA%3A1007662407062 Large Margin Classification using the Perception Algorithm]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 37, No. 3, [http://cseweb.ucsd.edu/~yfreund/papers/LargeMarginsUsingPerceptron.pdf pdf]
==2000 ...==
* [[David McAllester]], [[Robert Schapire]] ('''2000'''). ''On the Convergence Rate of Good-Turing Estimators''. [https://dblp.uni-trier.de/db/conf/colt/colt2000.html COLT 2000], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.340 CiteSeerX] <ref>[https://en.wikipedia.org/wiki/Good%E2%80%93Turing_frequency_estimation Good–Turing frequency estimation from Wikipedia]</ref> <ref>[[Jack Good]] ('''1953'''). ''[http://biomet.oxfordjournals.org/content/40/3-4/237 The population frequencies of species and the estimation of population parameters]''. [https://en.wikipedia.org/wiki/Biometrika Biometrika], Vol. 40, Nos. 3-4</ref> <ref>[[Jack Good]] ('''2000'''). ''[http://www.tandfonline.com/doi/abs/10.1080/00949650008812016 Turing’s anticipation of emprical Bayes in connection with the cryptanalysis of the naval enigma]''. [https://en.wikipedia.org/wiki/Journal_of_Statistical_Computation_and_Simulation Journal of Statistical Computation and Simulation], Vol. 66, No. 2</ref>
* [[Robert Schapire]] ('''2002'''). ''Advances in Boosting''. [https://dblp.uni-trier.de/db/conf/uai/uai2002.html UAI 2002], [http://arxiv.org/abs/1301.0599 arXiv:1301.0599]
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''2002'''). ''The Nonstochastic Multiarmed Bandit Problem''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 32, No. 1, [http://cseweb.ucsd.edu/~yfreund/papers/bandits.pdf 2001 pdf]
* [[Peter Stone]], [[Robert Schapire]], [[Michael L. Littman]], [[Mathematician#JACsirik|János A. Csirik]], [[David McAllester]] ('''2003'''). ''[https://www.jair.org/index.php/jair/article/view/10339 Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions]''. [http://www.jair.org/vol/vol19.html JAIR, Vol. 19]
* [[Robert Schapire]] ('''2003'''). ''[https://link.springer.com/chapter/10.1007%2F978-0-387-21579-2_9 The Boosting Approach to Machine Learning: An Overview]''. [https://link.springer.com/book/10.1007/978-0-387-21579-2 Nonlinear Estimation and Classification], [https://link.springer.com/bookseries/694 Lecture Notes in Statistics], Vol. 171, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [https://www.cs.princeton.edu/courses/archive/spring07/cos424/papers/boosting-survey.pdf 2002 pdf]
* [[Mathematician#CRudin|Cynthia Rudin]], [[Mathematician#IDaubechie|Ingrid Daubechies]], [[Robert Schapire]] ('''2004'''). ''The Dynamics of AdaBoost: Cyclic Behavior and Convergence of Margins''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 5, [http://rob.schapire.net/papers/dynada.pdf pdf]
==2005 ...==
* [[Mathematician#CRudin|Cynthia Rudin]], [[Robert Schapire]], [[Mathematician#IDaubechie|Ingrid Daubechies]] ('''2007'''). ''[https://projecteuclid.org/euclid.aos/1201012978 Analysis of boosting algorithms using the smooth margin function]''. [https://en.wikipedia.org/wiki/Annals_of_Statistics Annals of Statistics], Vol. 35, No. 6, [https://arxiv.org/abs/0803.4092 arXiv:0803.4092]
* [[Mathematician#USyed|Umar Syed]], [[Robert Schapire]] ('''2007'''). ''A Game-Theoretic Approach to Apprenticeship Learning''. [https://dblp.uni-trier.de/db/conf/nips/nips2007.html NIPS 2007], [https://www.cs.princeton.edu/~schapire/papers/SyedSchapireNIPS2007.pdf pdf]
* [[Mathematician#USyed|Umar Syed]], [[Michael Bowling]], [[Robert Schapire]] ('''2008'''). ''Apprenticeship learning using linear programming''. [https://dblp.uni-trier.de/db/conf/icml/icml2008.html ICML 2008], [http://rob.schapire.net/papers/SyedBowlingSchapireICML2008.pdf pdf]
* [[Mathematician#IMukherjee|Indraneel Mukherjee]], [[Robert Schapire]] ('''2008'''). ''Learning with Continuous Experts Using Drifting Games''. [https://dblp.uni-trier.de/db/conf/alt/alt2008.html ALT 2008], [https://www.cs.princeton.edu/~schapire/papers/contexp-alt08.pdf pdf]
* [[Mathematician#CRudin|Cynthia Rudin]], [[Robert Schapire]] ('''2009'''). ''Margin-based Ranking and an Equivalence between AdaBoost and RankBoost''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 10, [http://jmlr.org/papers/volume10/rudin09a/rudin09a.pdf pdf]
==2010 ...==
* [[Robert Schapire]] ('''2010'''). ''The Convergence Rate of AdaBoost''. [https://dblp.uni-trier.de/db/conf/colt/colt2010.html COLT 2010], [https://www.cs.princeton.edu/~schapire/papers/ada-open.pdf pdf]
* [[Mathematician#IMukherjee|Indraneel Mukherjee]], [[Mathematician#CRudin|Cynthia Rudin]], [[Robert Schapire]] ('''2011'''). ''The Rate of Convergence of AdaBoost''. [https://arxiv.org/abs/1106.6024 arXiv:1106.6024]
* [[Robert Schapire]], [[Yoav Freund]] ('''2012'''). ''[https://mitpress.mit.edu/books/boosting Boosting: Foundations and Algorithms]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
* [[Mathematician#IMukherjee|Indraneel Mukherjee]], [[Robert Schapire]] ('''2013'''). ''A Theory of Multiclass Boosting''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 14, [https://www.cs.princeton.edu/~schapire/papers/multiboost-journal.pdf pdf]
* [https://scholar.google.de/citations?user=ct2hw4UAAAAJ Haipeng Luo], [[Robert Schapire]] ('''2013'''). ''Towards Minimax Online Learning with Unknown Time Horizon''. [https://arxiv.org/abs/1307.8187 arXiv:1307.8187]
* [https://scholar.google.de/citations?user=ct2hw4UAAAAJ Haipeng Luo], [[Robert Schapire]] ('''2014'''). ''A Drifting-Games Analysis for Online Learning and Applications to Boosting''. [https://arxiv.org/abs/1406.1856 arXiv:1406.1856]
==2015 ...==
* [https://dblp.uni-trier.de/pers/hd/s/Syrgkanis:Vasilis Vasilis Syrgkanis], [https://dblp.uni-trier.de/pers/hd/a/Agarwal:Alekh Alekh Agarwal], [https://scholar.google.de/citations?user=ct2hw4UAAAAJ Haipeng Luo], [[Robert Schapire]] ('''2015'''). ''Fast Convergence of Regularized Learning in Games''. [https://arxiv.org/abs/1507.00407 arXiv:1507.00407]
* [https://scholar.google.com/citations?user=mRI6AogAAAAJ&hl=en Furong Huang], [https://dblp.uni-trier.de/pers/hd/a/Ash:Jordan_T= Jordan T. Ash], [https://dblp.uni-trier.de/pers/hd/l/Langford_0001:John John Langford], [[Robert Schapire]] ('''2017'''). ''Learning Deep ResNet Blocks Sequentially using Boosting Theory''. [https://arxiv.org/abs/1706.04964 arXiv:1706.04964]
=External Links=
* [https://www.microsoft.com/en-us/research/people/schapire/ Robert Schapire - Microsoft Research]
* [https://en.wikipedia.org/wiki/Robert_Schapire Robert Schapire from Wikipedia]
* [https://scholar.google.com/citations?user=39JcQcEAAAAJ&hl=en Robert Schapire - Google Scholar Citations]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=95087 The Mathematics Genealogy Project - Robert Schapire]
* Robert Schapire on Multiclass Boosting, [https://en.wikipedia.org/wiki/Partha_Niyogi Partha Niyogi] [http://parthaniyogiconference.cs.uchicago.edu/ Memorial Conference], [https://en.wikipedia.org/wiki/University_of_Chicago University of Chicago] , December 4, 2011, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=L6BlpGnCYVg|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one Level]]'''
[[Caregory:Mathematician|Schapire]]
[[Caregory:Researcher|Schapire]]
[[Caregory:Videos|Schapire]]
[[FILE:RobertSchapire.jpg|border|right|thumb|link=https://www.icmla-conference.org/icmla09/| Robert Schapire <ref>[http://www.icmla-conference.org/icmla09/ ICMLA 2009 - Invited Speakers]</ref> <ref>[http://videolectures.net/robert_schapire/ Robert Schapire - Department of Computer Science, Princeton University - VideoLectures.NET]</ref> ]]
'''Robert E. Schapire''',<br/>
an American mathematician, computer scientist, professor at [https://en.wikipedia.org/wiki/Princeton_University Princeton University], and since 2014 principal researcher at [[Microsoft]] [https://en.wikipedia.org/wiki/Microsoft_Research Research] <ref>[https://www.microsoft.com/en-us/research/people/schapire/ Robert Schapire - Microsoft Research]</ref>.
He received his Bachelor degree in mathematics and CS from [https://en.wikipedia.org/wiki/Brown_University Brown University] in 1986, and his Masters degree and Ph.D. from [[Massachusetts Institute of Technology|MIT]] in 1988 and 1991 respectively, both under the supervision of [[Ronald L. Rivest]] <ref>[https://www.icmla-conference.org/icmla09/ ICMLA 2009 - Invited Speakers]</ref>.
His research interest is in theoretical and applied [[Learning|machine learning]], with particular focus on [https://en.wikipedia.org/wiki/Computational_statistics computational statistics], [https://en.wikipedia.org/wiki/Boosting_%28machine_learning%29 boosting], [https://en.wikipedia.org/wiki/Online_machine_learning online learning], [https://en.wikipedia.org/wiki/Game_theory game theory], and [https://en.wikipedia.org/wiki/Principle_of_maximum_entropy maximum entropy].
On his work in collaboration with [[Yoav Freund]] on [https://en.wikipedia.org/wiki/AdaBoost AdaBoost], an [https://en.wikipedia.org/wiki/Ensemble_learning ensemble learning] algorithm which is used to combine many "weak" learning machines to create a more robust one, he received the 2003 [https://en.wikipedia.org/wiki/G%C3%B6del_Prize Gödel prize] in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science], and the [https://en.wikipedia.org/wiki/Paris_Kanellakis_Award Paris Kanellakis Award] in 2004. Further, along with [[Peter Auer]] and [[Nicolò Cesa-Bianchi]], Yoav Freund and Robert Schapire worked on [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit problems] <ref>[[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html NeuroCOLT2], [http://www.dklevine.com/archive/refs4462.pdf pdf]</ref>.
=Selected Publications=
<ref>[https://www.cs.princeton.edu/~schapire/publist.html Robert Schapire - Publication list]</ref> <ref>[https://dblp.uni-trier.de/pers/hd/s/Schapire:Robert_E= dblp: Robert E. Schapire]</ref>
==1987 ...==
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1987'''). ''Diversity-Based Inference of Finite Automata''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/focs/focs87.html FOCS 1987], [https://people.csail.mit.edu/rivest/pubs/RS87c.pdf pdf]
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1989'''). ''Inference of Finite Automata Using Homing Sequences''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/stoc/stoc89.html STOC 1989], [https://people.csail.mit.edu/rivest/RivestSchapire-InferenceOfFiniteAutomataUsingHomingSequences-STOC89.pdf pdf]
* [[Robert Schapire]] ('''1989'''). ''The Strength of Weak Learnability''. (Extended Abstract) [https://dblp.uni-trier.de/db/conf/focs/focs89.html FOCS 1989]
==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]
* [[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]
* [[Robert Schapire]] ('''1991'''). ''The Design and Analysis of Efficient Learning Algorithms''. Ph.D. thesis, [[Massachusetts Institute of Technology|MIT]], supervisor [[Ronald L. Rivest]], [https://apps.dtic.mil/dtic/tr/fulltext/u2/a231888.pdf pdf]
* [[Robert Schapire]] ('''1992'''). ''[https://dl.acm.org/citation.cfm?id=136314 The Design and Analysis of Efficient Learning Algorithms]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press], (ACM Doctoral Dissertation Award), [https://www.amazon.com/Analysis-Efficient-Learning-Algorithms-Dissertation/dp/0262193256 amazon]
* [[Ronald L. Rivest]], [[Robert Schapire]] ('''1994'''). ''Diversity-Based Inference of Finite Automata''. [[ACM#Journal|Journal of the ACM]], Vol. 41, No. 3, [https://www.cs.princeton.edu/~schapire/papers/diversity-based-inference.pdf pdf]
==1995 ...==
* [[Yoav Freund]], [[Robert Schapire]] ('''1996'''). ''Game Theory, On-line Prediction and Boosting''. [https://dblp.uni-trier.de/db/conf/colt/colt1996.html COLT 1996], [http://www.cs.princeton.edu/~schapire/papers/FreundSc96b.pdf pdf]
* [[Robert Schapire]], [[Mathematician#MKWarmuth|Manfred K. Warmuth]] ('''1996'''). ''On the Worst-Case Analysis of Temporal-Difference Learning Algorithms''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 22, Nos. 1-3, [https://users.soe.ucsc.edu/~manfred/pubs/J34.pdf pdf]
* [[Yoav Freund]], [[Robert Schapire]] ('''1997'''). ''A decision-theoretic generalization of on-line learning and an application to boosting''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 55, No. 1, [http://cseweb.ucsd.edu/~yfreund/papers/adaboost.pdf 1996 pdf] » [https://en.wikipedia.org/wiki/AdaBoost AdaBoost]
* [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Mathematician#DPHelmbold|David P. Helmbold]], [[Mathematician#DHHaussler|David Haussler]], [[Robert Schapire]], [[Mathematician#MKWarmuth|Manfred K. Warmuth]] ('''1997'''). ''How to Use Expert Advice''. [[ACM#Journal|Journal of the ACM]], Vol. 44, No. 3, [http://homes.di.unimi.it/cesa-bianchi/Pubblicazioni/jacm-97a.pdf pdf]
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html NeuroCOLT2], [http://www.dklevine.com/archive/refs4462.pdf pdf]
* [[Robert Schapire]], [[Yoav Freund]], [[Peter Bartlett]], [[Wee Sun Lee]] ('''1998'''). ''Boosting the margin: A new explanation for the effectiveness of voting methods''. [https://en.wikipedia.org/wiki/Annals_of_Statistics Annals of Statistic], [http://www.cc.gatech.edu/~isbell/tutorials/boostingmargins.pdf pdf]
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''Adaptive game playing using multiplicative weights''. [https://en.wikipedia.org/wiki/Games_and_Economic_Behavior Games and Economic Behavior], Vol. 29, [http://cseweb.ucsd.edu/~yfreund/papers/games_long.pdf pdf]
* [[Robert Schapire]] ('''1999'''). ''[https://dl.acm.org/citation.cfm?id=1624417 A Brief Introduction to Boosting]''. [[Conferences#IJCAI1999|IJCAI 1999]], [https://www.ijcai.org/Proceedings/99-2/Papers/103.pdf pdf]
* [[Robert Schapire]] ('''1999'''). ''[https://link.springer.com/chapter/10.1007%2F3-540-46769-6_2 Theoretical Views of Boosting and Applications]''. [https://dblp.uni-trier.de/db/conf/alt/alt1999.html ALT 1999], [http://www-ai.cs.uni-dortmund.de/LEHRE/PG/PG445/literatur/schapire_99a.pdf pdf]
* [[Robert Schapire]] ('''1999'''). ''Drifting Games''. [https://dblp.uni-trier.de/db/conf/colt/colt1999.html COLT 1999], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.1290 CiteSeerX]
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''[https://link.springer.com/article/10.1023%2FA%3A1007662407062 Large Margin Classification using the Perception Algorithm]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 37, No. 3, [http://cseweb.ucsd.edu/~yfreund/papers/LargeMarginsUsingPerceptron.pdf pdf]
==2000 ...==
* [[David McAllester]], [[Robert Schapire]] ('''2000'''). ''On the Convergence Rate of Good-Turing Estimators''. [https://dblp.uni-trier.de/db/conf/colt/colt2000.html COLT 2000], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.340 CiteSeerX] <ref>[https://en.wikipedia.org/wiki/Good%E2%80%93Turing_frequency_estimation Good–Turing frequency estimation from Wikipedia]</ref> <ref>[[Jack Good]] ('''1953'''). ''[http://biomet.oxfordjournals.org/content/40/3-4/237 The population frequencies of species and the estimation of population parameters]''. [https://en.wikipedia.org/wiki/Biometrika Biometrika], Vol. 40, Nos. 3-4</ref> <ref>[[Jack Good]] ('''2000'''). ''[http://www.tandfonline.com/doi/abs/10.1080/00949650008812016 Turing’s anticipation of emprical Bayes in connection with the cryptanalysis of the naval enigma]''. [https://en.wikipedia.org/wiki/Journal_of_Statistical_Computation_and_Simulation Journal of Statistical Computation and Simulation], Vol. 66, No. 2</ref>
* [[Robert Schapire]] ('''2002'''). ''Advances in Boosting''. [https://dblp.uni-trier.de/db/conf/uai/uai2002.html UAI 2002], [http://arxiv.org/abs/1301.0599 arXiv:1301.0599]
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''2002'''). ''The Nonstochastic Multiarmed Bandit Problem''. [https://en.wikipedia.org/wiki/SIAM_Journal_on_Computing SIAM Journal on Computing], Vol. 32, No. 1, [http://cseweb.ucsd.edu/~yfreund/papers/bandits.pdf 2001 pdf]
* [[Peter Stone]], [[Robert Schapire]], [[Michael L. Littman]], [[Mathematician#JACsirik|János A. Csirik]], [[David McAllester]] ('''2003'''). ''[https://www.jair.org/index.php/jair/article/view/10339 Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions]''. [http://www.jair.org/vol/vol19.html JAIR, Vol. 19]
* [[Robert Schapire]] ('''2003'''). ''[https://link.springer.com/chapter/10.1007%2F978-0-387-21579-2_9 The Boosting Approach to Machine Learning: An Overview]''. [https://link.springer.com/book/10.1007/978-0-387-21579-2 Nonlinear Estimation and Classification], [https://link.springer.com/bookseries/694 Lecture Notes in Statistics], Vol. 171, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [https://www.cs.princeton.edu/courses/archive/spring07/cos424/papers/boosting-survey.pdf 2002 pdf]
* [[Mathematician#CRudin|Cynthia Rudin]], [[Mathematician#IDaubechie|Ingrid Daubechies]], [[Robert Schapire]] ('''2004'''). ''The Dynamics of AdaBoost: Cyclic Behavior and Convergence of Margins''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 5, [http://rob.schapire.net/papers/dynada.pdf pdf]
==2005 ...==
* [[Mathematician#CRudin|Cynthia Rudin]], [[Robert Schapire]], [[Mathematician#IDaubechie|Ingrid Daubechies]] ('''2007'''). ''[https://projecteuclid.org/euclid.aos/1201012978 Analysis of boosting algorithms using the smooth margin function]''. [https://en.wikipedia.org/wiki/Annals_of_Statistics Annals of Statistics], Vol. 35, No. 6, [https://arxiv.org/abs/0803.4092 arXiv:0803.4092]
* [[Mathematician#USyed|Umar Syed]], [[Robert Schapire]] ('''2007'''). ''A Game-Theoretic Approach to Apprenticeship Learning''. [https://dblp.uni-trier.de/db/conf/nips/nips2007.html NIPS 2007], [https://www.cs.princeton.edu/~schapire/papers/SyedSchapireNIPS2007.pdf pdf]
* [[Mathematician#USyed|Umar Syed]], [[Michael Bowling]], [[Robert Schapire]] ('''2008'''). ''Apprenticeship learning using linear programming''. [https://dblp.uni-trier.de/db/conf/icml/icml2008.html ICML 2008], [http://rob.schapire.net/papers/SyedBowlingSchapireICML2008.pdf pdf]
* [[Mathematician#IMukherjee|Indraneel Mukherjee]], [[Robert Schapire]] ('''2008'''). ''Learning with Continuous Experts Using Drifting Games''. [https://dblp.uni-trier.de/db/conf/alt/alt2008.html ALT 2008], [https://www.cs.princeton.edu/~schapire/papers/contexp-alt08.pdf pdf]
* [[Mathematician#CRudin|Cynthia Rudin]], [[Robert Schapire]] ('''2009'''). ''Margin-based Ranking and an Equivalence between AdaBoost and RankBoost''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 10, [http://jmlr.org/papers/volume10/rudin09a/rudin09a.pdf pdf]
==2010 ...==
* [[Robert Schapire]] ('''2010'''). ''The Convergence Rate of AdaBoost''. [https://dblp.uni-trier.de/db/conf/colt/colt2010.html COLT 2010], [https://www.cs.princeton.edu/~schapire/papers/ada-open.pdf pdf]
* [[Mathematician#IMukherjee|Indraneel Mukherjee]], [[Mathematician#CRudin|Cynthia Rudin]], [[Robert Schapire]] ('''2011'''). ''The Rate of Convergence of AdaBoost''. [https://arxiv.org/abs/1106.6024 arXiv:1106.6024]
* [[Robert Schapire]], [[Yoav Freund]] ('''2012'''). ''[https://mitpress.mit.edu/books/boosting Boosting: Foundations and Algorithms]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
* [[Mathematician#IMukherjee|Indraneel Mukherjee]], [[Robert Schapire]] ('''2013'''). ''A Theory of Multiclass Boosting''. [https://en.wikipedia.org/wiki/Journal_of_Machine_Learning_Research Journal of Machine Learning Research], Vol. 14, [https://www.cs.princeton.edu/~schapire/papers/multiboost-journal.pdf pdf]
* [https://scholar.google.de/citations?user=ct2hw4UAAAAJ Haipeng Luo], [[Robert Schapire]] ('''2013'''). ''Towards Minimax Online Learning with Unknown Time Horizon''. [https://arxiv.org/abs/1307.8187 arXiv:1307.8187]
* [https://scholar.google.de/citations?user=ct2hw4UAAAAJ Haipeng Luo], [[Robert Schapire]] ('''2014'''). ''A Drifting-Games Analysis for Online Learning and Applications to Boosting''. [https://arxiv.org/abs/1406.1856 arXiv:1406.1856]
==2015 ...==
* [https://dblp.uni-trier.de/pers/hd/s/Syrgkanis:Vasilis Vasilis Syrgkanis], [https://dblp.uni-trier.de/pers/hd/a/Agarwal:Alekh Alekh Agarwal], [https://scholar.google.de/citations?user=ct2hw4UAAAAJ Haipeng Luo], [[Robert Schapire]] ('''2015'''). ''Fast Convergence of Regularized Learning in Games''. [https://arxiv.org/abs/1507.00407 arXiv:1507.00407]
* [https://scholar.google.com/citations?user=mRI6AogAAAAJ&hl=en Furong Huang], [https://dblp.uni-trier.de/pers/hd/a/Ash:Jordan_T= Jordan T. Ash], [https://dblp.uni-trier.de/pers/hd/l/Langford_0001:John John Langford], [[Robert Schapire]] ('''2017'''). ''Learning Deep ResNet Blocks Sequentially using Boosting Theory''. [https://arxiv.org/abs/1706.04964 arXiv:1706.04964]
=External Links=
* [https://www.microsoft.com/en-us/research/people/schapire/ Robert Schapire - Microsoft Research]
* [https://en.wikipedia.org/wiki/Robert_Schapire Robert Schapire from Wikipedia]
* [https://scholar.google.com/citations?user=39JcQcEAAAAJ&hl=en Robert Schapire - Google Scholar Citations]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=95087 The Mathematics Genealogy Project - Robert Schapire]
* Robert Schapire on Multiclass Boosting, [https://en.wikipedia.org/wiki/Partha_Niyogi Partha Niyogi] [http://parthaniyogiconference.cs.uchicago.edu/ Memorial Conference], [https://en.wikipedia.org/wiki/University_of_Chicago University of Chicago] , December 4, 2011, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=L6BlpGnCYVg|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one Level]]'''
[[Caregory:Mathematician|Schapire]]
[[Caregory:Researcher|Schapire]]
[[Caregory:Videos|Schapire]]
