Difference between revisions of "Yoav Freund"
GerdIsenberg (talk  contribs) (Created page with "'''Home * People * Yoav Freund''' FILE:YoavFreund.jpgborderrightthumblink=http://cseweb.ucsd.edu/~yfreund/ Yoav Freund <ref> [http://cseweb.ucsd.edu...") 
(No difference)

Latest revision as of 16:55, 11 April 2021
Yoav Freund,
an Israeli mathematician, computer scientist and professor of CS at the University of California, San Diego.
His research covers the area of machine learning, computational statistics, data mining and their applications.
He received his Ph.D. degree in 1993 from University of California, Santa Cruz, advisors of his thesis Data Filtering and Distribution Modeling Algorithms for Machine Learning were Manfred K. Warmuth, David Haussler and David P. Helmbold ^{[2]}.
He is most famous for his work with Robert Schapire on boosting and the formulation of the AdaBoost algorithm
^{[3]},
awarded with the 2003 Gödel prize in theoretical computer science,
and with the Paris Kanellakis Prize in 2004. Further, along with Peter Auer and Nicolò CesaBianchi, Yoav Freund and Robert Schapire worked on multiarmed bandit problems
^{[4]}.
Contents
Selected Publications
^{[5]}
1990 ...
 Yoav Freund (1990). Boosting a Weak Learning Algorithm by Majority. COLT 1990
 Yoav Freund, David Haussler (1991). Unsupervised Learning of Distributions of Binary Vectors Using 2Layer Networks. NIPS 1991
 Yoav Freund (1993). Data Filtering and Distribution Modeling Algorithms for Machine Learning. Ph.D. thesis, University of California, Santa Cruz, advisors Manfred K. Warmuth, David Haussler, David P. Helmbold
1995 ...
 Yoav Freund.(1995). Boosting a Weak Learning Algorithm by Majority. Information and Computation, Vol. 121, No. 2
 Yoav Freund, Robert Schapire (1996). Experiments with a New Boosting Algorithm. ICML 1996
 Yoav Freund, Robert Schapire (1996). Game Theory, Online Prediction and Boosting. COLT 1996
 Yoav Freund (1996). Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin. COLT 1996
 Nicolò CesaBianchi, Yoav Freund, David P. Helmbold, Manfred K. Warmuth (1996). Online Prediction and Conversion Strategies. Machine Learning, Vol. 25, No 1
 Yoav Freund, Robert Schapire (1997). A DecisionTheoretic Generalization of OnLine 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, 1996 pdf » AdaBoost
 Nicolò CesaBianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert Schapire, Manfred K. Warmuth (1997). How to Use Expert Advice. Journal of the ACM, Vol. 44, No. 3, pdf
 Peter Auer, Nicolò CesaBianchi, Yoav Freund, Robert Schapire (1998). Gambling in a rigged casino: The adversarial multiarm bandit problem. NeuroCOLT2, pdf
 Robert Schapire, Yoav Freund, Peter Bartlett, Wee Sun Lee (1998). Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistic, Vol. 26, No. 5
 Yoav Freund, Robert Schapire (1999). Adaptive Game Playing Using Multiplicative Weights. Games and Economic Behavior, Vol. 29, pdf
 Yoav Freund, Robert Schapire (1999). Large Margin Classification using the Perception Algorithm. Machine Learning, Vol. 37, No. 3, pdf
2000 ...
 Yoav Freund, Manfred Opper (2000). Continuous Drifting Games. COLT 2000, pdf, 2001 pdf
 Yoav Freund (2001). An Adaptive Version of the Boost by Majority Algorithm. Machine Learning, Vol. 43, No. 3
 Yoav Freund, Manfred Opper (2002). Drifting Games and Brownian Motion. Journal of Computer and System Sciences, Vol. 64, No. 1
 Peter Auer, Nicolò CesaBianchi, Yoav Freund, Robert Schapire (2002). The Nonstochastic Multiarmed Bandit Problem. SIAM Journal on Computing, Vol. 32, No. 1, 2001 pdf
2005 ...
 Sanjoy Dasgupta, Yoav Freund (2008). Random projection trees and low dimensional manifolds. STOC 2008, pdf
 Yoav Freund (2008). From Microscopy Images to Models of Cellular Processes. ECML/PKDD
 Sanjoy Dasgupta, Yoav Freund (2009). Random projection trees for vector quantization. IEEE Transactions on Information Theory, Vol. 55, No. 7
 Yoav Freund (2009). A method for Hedging in continuous time. arXiv:0904.3356 ^{[6]}
2010 ...
 Yoav Freund (2010). Data winnowing. KDD 2010
 Robert Schapire, Yoav Freund (2012). Boosting: Foundations and Algorithms. MIT Press
2015 ...
 Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund (2015). The Fast Convergence of Incremental PCA. arXiv:1501.03796 ^{[7]}
 Akshay Balsubramani, Yoav Freund (2015). PACBayes with Minimax for ConfidenceRated Transduction. arXiv:1501.03838 ^{[8]}
 Akshay Balsubramani, Yoav Freund (2015). Optimally Combining Classifiers Using Unlabeled Data. arXiv:1503.01811
 Akshay Balsubramani, Yoav Freund (2016). Muffled SemiSupervised Learning. arXiv:1605.08833
 Julaiti Alafate, Yoav Freund (2018). Tell Me Something New: A New Framework for Asynchronous Parallel Learning. arXiv:1805.07483
 Julaiti Alafate, Yoav Freund (2019). Faster Boosting with Smaller Memory. arXiv:1901.09047
 Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund, Shay Moran (2019). An adaptive nearest neighbor rule for classification. arXiv:1905.12717
2020 ...
 Julaiti Alafate, Yoav Freund, David T. Sandwell, Brook Tozer (2020). Experimental Design for Bathymetry Editing. arXiv:2007.07495
External Links
 Yoav Freund's Home Page
 Yoav Freund from Wikipedia
 The Mathematics Genealogy Project  Yoav Freund
 Yoav Freund  Google Scholar Citations
References
 ↑ Yoav Freund's Home Page
 ↑ The Mathematics Genealogy Project  Yoav Freund
 ↑ Yoav Freund, Robert Schapire (1997). A DecisionTheoretic Generalization of OnLine Learning and an Application to Boosting. Journal of Computer and System Sciences, Vol. 55, No. 1, 1996 pdf
 ↑ Peter Auer, Nicolò CesaBianchi, Yoav Freund, Robert Schapire (1998). Gambling in a rigged casino: The adversarial multiarm bandit problem. NeuroCOLT2, pdf
 ↑ dblp: Yoav Freund
 ↑ Hedge Algorithm — online prediction wiki
 ↑ Principal component analysis from Wikipedia
 ↑ Probably approximately correct learning from Wikipedia