25,161
edits
Changes
Created page with "'''Home * People * Yoav Freund''' FILE:YoavFreund.jpg|border|right|thumb|link=http://cseweb.ucsd.edu/~yfreund/| Yoav Freund <ref> [http://cseweb.ucsd.edu..."
'''[[Main Page|Home]] * [[People]] * Yoav Freund'''
[[FILE:YoavFreund.jpg|border|right|thumb|link=http://cseweb.ucsd.edu/~yfreund/| Yoav Freund <ref> [http://cseweb.ucsd.edu/~yfreund/ Yoav Freund's Home Page]</ref> ]]
'''Yoav Freund''',<br/>
an Israeli mathematician, computer scientist and professor of CS at the [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego].
His research covers the area of [[Learning|machine learning]], [https://en.wikipedia.org/wiki/Computational_statistics computational statistics], [https://en.wikipedia.org/wiki/Data_mining 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 [[Mathematician#MKWarmuth|Manfred K. Warmuth]], [[Mathematician#DHHaussler|David Haussler]] and [[Mathematician#DPHelmbold|David P. Helmbold]] <ref>[https://www.mathgenealogy.org/id.php?id=101119 The Mathematics Genealogy Project - Yoav Freund]</ref>.
He is most famous for his work with [[Robert Schapire]] on [https://en.wikipedia.org/wiki/Boosting_%28machine_learning%29 boosting] and the formulation of the [https://en.wikipedia.org/wiki/AdaBoost AdaBoost] algorithm
<ref>[[Yoav Freund]], [[Robert Schapire]] ('''1997'''). ''[https://www.sciencedirect.com/science/article/pii/S002200009791504X 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]</ref>,
awarded with 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 with the [https://en.wikipedia.org/wiki/Paris_Kanellakis_Award Paris Kanellakis Prize] 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://dblp.uni-trier.de/pid/f/YoavFreund.html dblp: Yoav Freund]</ref>
==1990 ...==
* [[Yoav Freund]] ('''1990'''). ''Boosting a Weak Learning Algorithm by Majority''. [https://dblp.uni-trier.de/db/conf/colt/colt1990.html#Freund90 COLT 1990]
* [[Yoav Freund]], [[Mathematician#DHHaussler|David Haussler]] ('''1991'''). ''Unsupervised Learning of Distributions of Binary Vectors Using 2-Layer Networks''. [https://dblp.uni-trier.de/db/conf/nips/nips1991.html#FreundH91 NIPS 1991]
* [[Yoav Freund]] ('''1993'''). ''Data Filtering and Distribution Modeling Algorithms for Machine Learning''. Ph.D. thesis, [[University of California, Santa Cruz]], advisors [[Mathematician#MKWarmuth|Manfred K. Warmuth]], [[Mathematician#DHHaussler|David Haussler]], [[Mathematician#DPHelmbold|David P. Helmbold]]
==1995 ...==
* [[Yoav Freund]].('''1995'''). ''[https://www.sciencedirect.com/science/article/pii/S0890540185711364 Boosting a Weak Learning Algorithm by Majority]''. [https://en.wikipedia.org/wiki/Information_and_Computation Information and Computation], Vol. 121, No. 2
* [[Yoav Freund]], [[Robert Schapire]] ('''1996'''). ''Experiments with a New Boosting Algorithm''. [https://dblp.uni-trier.de/db/conf/icml/icml1996.html#FreundS96 ICML 1996]
* [[Yoav Freund]], [[Robert Schapire]] ('''1996'''). ''Game Theory, On-line Prediction and Boosting''. [https://dblp.uni-trier.de/db/conf/colt/colt1996.html#FreundS96 COLT 1996]
* [[Yoav Freund]] ('''1996'''). ''Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin''. [https://dblp.uni-trier.de/db/conf/colt/colt1996.html#Freund96 COLT 1996]
* [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Mathematician#DPHelmbold|David P. Helmbold]], [[Mathematician#MKWarmuth|Manfred K. Warmuth]] ('''1996'''). ''On-line Prediction and Conversion Strategies''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 25, No 1
* [[Yoav Freund]], [[Robert Schapire]] ('''1997'''). ''[https://www.sciencedirect.com/science/article/pii/S002200009791504X 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'''). ''[https://projecteuclid.org/journals/annals-of-statistics/volume-26/issue-5/Boosting-the-margin--a-new-explanation-for-the-effectiveness/10.1214/aos/1024691352.full Boosting the margin: A new explanation for the effectiveness of voting methods]''. [https://en.wikipedia.org/wiki/Annals_of_Statistics Annals of Statistic], Vol. 26, No. 5
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S0899825699907388 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]
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''[https://link.springer.com/article/10.1023/A:1007662407062 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 ...==
* [[Yoav Freund]], [[Manfred Opper]] ('''2000'''). ''Continuous Drifting Games''. [https://dblp.uni-trier.de/db/conf/colt/colt2000.html#FreundO00 COLT 2000], [http://www.ki.tu-berlin.de/fileadmin/fg135/publikationen/opper/FrOp00.pdf pdf], [https://cseweb.ucsd.edu/~yfreund/papers/brownOpper.pdf 2001 pdf]
* [[Yoav Freund]] ('''2001'''). ''An Adaptive Version of the Boost by Majority Algorithm''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 43, No. 3
* [[Yoav Freund]], [[Manfred Opper]] ('''2002'''). ''[https://www.sciencedirect.com/science/article/pii/S0022000001918021 Drifting Games and Brownian Motion]''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 64, No. 1
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''2002'''). ''[https://epubs.siam.org/doi/abs/10.1137/S0097539701398375?journalCode=smjcat 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]
==2005 ...==
* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]] ('''2008'''). ''Random projection trees and low dimensional manifolds''. [https://dblp.uni-trier.de/db/conf/stoc/stoc2008.html#DasguptaF08 STOC 2008], [http://cseweb.ucsd.edu/~dasgupta/papers/rptree-stoc.pdf pdf]
* [[Yoav Freund]] ('''2008'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-87479-9_2 From Microscopy Images to Models of Cellular Processes]''. [https://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#Freund08 ECML/PKDD]
* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]] ('''2009'''). ''[https://ieeexplore.ieee.org/document/5075899 Random projection trees for vector quantization]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 55, No. 7
* [[Yoav Freund]] ('''2009'''). ''A method for Hedging in continuous time''. [https://arxiv.org/abs/0904.3356 arXiv:0904.3356] <ref>[http://onlineprediction.net/index.html?n=Main.HedgeAlgorithm Hedge Algorithm — on-line prediction wiki]</ref>
==2010 ...==
* [[Yoav Freund]] ('''2010'''). ''[https://dl.acm.org/doi/abs/10.1145/1835804.1835806 Data winnowing]''. [https://dblp.uni-trier.de/db/conf/kdd/kdd2010.html#Freund10 KDD 2010]
* [[Robert Schapire]], [[Yoav Freund]] ('''2012'''). ''[https://mitpress.mit.edu/books/boosting Boosting: Foundations and Algorithms]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
==2015 ...==
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]] ('''2015'''). ''The Fast Convergence of Incremental PCA''. [https://arxiv.org/abs/1501.03796 arXiv:1501.03796] <ref>[https://en.wikipedia.org/wiki/Principal_component_analysis Principal component analysis from Wikipedia]</ref>
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Yoav Freund]] ('''2015'''). ''PAC-Bayes with Minimax for Confidence-Rated Transduction''. [https://arxiv.org/abs/1501.03838 arXiv:1501.03838] <ref>[https://en.wikipedia.org/wiki/Probably_approximately_correct_learning Probably approximately correct learning from Wikipedia]</ref>
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Yoav Freund]] ('''2015'''). ''Optimally Combining Classifiers Using Unlabeled Data''. [https://arxiv.org/abs/1503.01811 arXiv:1503.01811]
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Yoav Freund]] ('''2016'''). ''Muffled Semi-Supervised Learning''. [https://arxiv.org/abs/1605.08833 arXiv:1605.08833]
* [https://scholar.google.com/citations?user=TuA50FUAAAAJ&hl=en Julaiti Alafate], [[Yoav Freund]] ('''2018'''). ''Tell Me Something New: A New Framework for Asynchronous Parallel Learning''. [https://arxiv.org/abs/1805.07483 arXiv:1805.07483]
* [https://scholar.google.com/citations?user=TuA50FUAAAAJ&hl=en Julaiti Alafate], [[Yoav Freund]] ('''2019'''). ''Faster Boosting with Smaller Memory''. [https://arxiv.org/abs/1901.09047 arXiv:1901.09047]
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]], [[Mathematician#SMoran|Shay Moran]] ('''2019'''). ''An adaptive nearest neighbor rule for classification''. [https://arxiv.org/abs/1905.12717 arXiv:1905.12717]
==2020 ...==
* [https://scholar.google.com/citations?user=TuA50FUAAAAJ&hl=en Julaiti Alafate], [[Yoav Freund]], [https://scholar.google.com/citations?user=UKfoPcYAAAAJ&hl=en David T. Sandwell], Brook Tozer ('''2020'''). ''Experimental Design for Bathymetry Editing''. [https://arxiv.org/abs/2007.07495 arXiv:2007.07495]
=External Links=
* [http://cseweb.ucsd.edu/~yfreund/ Yoav Freund's Home Page]
* [https://en.wikipedia.org/wiki/Yoav_Freund Yoav Freund from Wikipedia]
* [https://www.mathgenealogy.org/id.php?id=101119 The Mathematics Genealogy Project - Yoav Freund]
* [https://scholar.google.com/citations?user=NFdG-GMAAAAJ Yoav Freund - Google Scholar Citations]
=References=
<references />
'''[[People|Up one Level]]'''
[[Category:Mathematician|Freund]]
[[Category:Researcher|Freund]]
[[FILE:YoavFreund.jpg|border|right|thumb|link=http://cseweb.ucsd.edu/~yfreund/| Yoav Freund <ref> [http://cseweb.ucsd.edu/~yfreund/ Yoav Freund's Home Page]</ref> ]]
'''Yoav Freund''',<br/>
an Israeli mathematician, computer scientist and professor of CS at the [https://en.wikipedia.org/wiki/University_of_California,_San_Diego University of California, San Diego].
His research covers the area of [[Learning|machine learning]], [https://en.wikipedia.org/wiki/Computational_statistics computational statistics], [https://en.wikipedia.org/wiki/Data_mining 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 [[Mathematician#MKWarmuth|Manfred K. Warmuth]], [[Mathematician#DHHaussler|David Haussler]] and [[Mathematician#DPHelmbold|David P. Helmbold]] <ref>[https://www.mathgenealogy.org/id.php?id=101119 The Mathematics Genealogy Project - Yoav Freund]</ref>.
He is most famous for his work with [[Robert Schapire]] on [https://en.wikipedia.org/wiki/Boosting_%28machine_learning%29 boosting] and the formulation of the [https://en.wikipedia.org/wiki/AdaBoost AdaBoost] algorithm
<ref>[[Yoav Freund]], [[Robert Schapire]] ('''1997'''). ''[https://www.sciencedirect.com/science/article/pii/S002200009791504X 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]</ref>,
awarded with 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 with the [https://en.wikipedia.org/wiki/Paris_Kanellakis_Award Paris Kanellakis Prize] 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://dblp.uni-trier.de/pid/f/YoavFreund.html dblp: Yoav Freund]</ref>
==1990 ...==
* [[Yoav Freund]] ('''1990'''). ''Boosting a Weak Learning Algorithm by Majority''. [https://dblp.uni-trier.de/db/conf/colt/colt1990.html#Freund90 COLT 1990]
* [[Yoav Freund]], [[Mathematician#DHHaussler|David Haussler]] ('''1991'''). ''Unsupervised Learning of Distributions of Binary Vectors Using 2-Layer Networks''. [https://dblp.uni-trier.de/db/conf/nips/nips1991.html#FreundH91 NIPS 1991]
* [[Yoav Freund]] ('''1993'''). ''Data Filtering and Distribution Modeling Algorithms for Machine Learning''. Ph.D. thesis, [[University of California, Santa Cruz]], advisors [[Mathematician#MKWarmuth|Manfred K. Warmuth]], [[Mathematician#DHHaussler|David Haussler]], [[Mathematician#DPHelmbold|David P. Helmbold]]
==1995 ...==
* [[Yoav Freund]].('''1995'''). ''[https://www.sciencedirect.com/science/article/pii/S0890540185711364 Boosting a Weak Learning Algorithm by Majority]''. [https://en.wikipedia.org/wiki/Information_and_Computation Information and Computation], Vol. 121, No. 2
* [[Yoav Freund]], [[Robert Schapire]] ('''1996'''). ''Experiments with a New Boosting Algorithm''. [https://dblp.uni-trier.de/db/conf/icml/icml1996.html#FreundS96 ICML 1996]
* [[Yoav Freund]], [[Robert Schapire]] ('''1996'''). ''Game Theory, On-line Prediction and Boosting''. [https://dblp.uni-trier.de/db/conf/colt/colt1996.html#FreundS96 COLT 1996]
* [[Yoav Freund]] ('''1996'''). ''Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin''. [https://dblp.uni-trier.de/db/conf/colt/colt1996.html#Freund96 COLT 1996]
* [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Mathematician#DPHelmbold|David P. Helmbold]], [[Mathematician#MKWarmuth|Manfred K. Warmuth]] ('''1996'''). ''On-line Prediction and Conversion Strategies''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 25, No 1
* [[Yoav Freund]], [[Robert Schapire]] ('''1997'''). ''[https://www.sciencedirect.com/science/article/pii/S002200009791504X 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'''). ''[https://projecteuclid.org/journals/annals-of-statistics/volume-26/issue-5/Boosting-the-margin--a-new-explanation-for-the-effectiveness/10.1214/aos/1024691352.full Boosting the margin: A new explanation for the effectiveness of voting methods]''. [https://en.wikipedia.org/wiki/Annals_of_Statistics Annals of Statistic], Vol. 26, No. 5
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''[https://www.sciencedirect.com/science/article/abs/pii/S0899825699907388 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]
* [[Yoav Freund]], [[Robert Schapire]] ('''1999'''). ''[https://link.springer.com/article/10.1023/A:1007662407062 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 ...==
* [[Yoav Freund]], [[Manfred Opper]] ('''2000'''). ''Continuous Drifting Games''. [https://dblp.uni-trier.de/db/conf/colt/colt2000.html#FreundO00 COLT 2000], [http://www.ki.tu-berlin.de/fileadmin/fg135/publikationen/opper/FrOp00.pdf pdf], [https://cseweb.ucsd.edu/~yfreund/papers/brownOpper.pdf 2001 pdf]
* [[Yoav Freund]] ('''2001'''). ''An Adaptive Version of the Boost by Majority Algorithm''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine Learning], Vol. 43, No. 3
* [[Yoav Freund]], [[Manfred Opper]] ('''2002'''). ''[https://www.sciencedirect.com/science/article/pii/S0022000001918021 Drifting Games and Brownian Motion]''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 64, No. 1
* [[Peter Auer]], [[Nicolò Cesa-Bianchi]], [[Yoav Freund]], [[Robert Schapire]] ('''2002'''). ''[https://epubs.siam.org/doi/abs/10.1137/S0097539701398375?journalCode=smjcat 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]
==2005 ...==
* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]] ('''2008'''). ''Random projection trees and low dimensional manifolds''. [https://dblp.uni-trier.de/db/conf/stoc/stoc2008.html#DasguptaF08 STOC 2008], [http://cseweb.ucsd.edu/~dasgupta/papers/rptree-stoc.pdf pdf]
* [[Yoav Freund]] ('''2008'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-87479-9_2 From Microscopy Images to Models of Cellular Processes]''. [https://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#Freund08 ECML/PKDD]
* [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]] ('''2009'''). ''[https://ieeexplore.ieee.org/document/5075899 Random projection trees for vector quantization]''. [[IEEE#TIT|IEEE Transactions on Information Theory]], Vol. 55, No. 7
* [[Yoav Freund]] ('''2009'''). ''A method for Hedging in continuous time''. [https://arxiv.org/abs/0904.3356 arXiv:0904.3356] <ref>[http://onlineprediction.net/index.html?n=Main.HedgeAlgorithm Hedge Algorithm — on-line prediction wiki]</ref>
==2010 ...==
* [[Yoav Freund]] ('''2010'''). ''[https://dl.acm.org/doi/abs/10.1145/1835804.1835806 Data winnowing]''. [https://dblp.uni-trier.de/db/conf/kdd/kdd2010.html#Freund10 KDD 2010]
* [[Robert Schapire]], [[Yoav Freund]] ('''2012'''). ''[https://mitpress.mit.edu/books/boosting Boosting: Foundations and Algorithms]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
==2015 ...==
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]] ('''2015'''). ''The Fast Convergence of Incremental PCA''. [https://arxiv.org/abs/1501.03796 arXiv:1501.03796] <ref>[https://en.wikipedia.org/wiki/Principal_component_analysis Principal component analysis from Wikipedia]</ref>
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Yoav Freund]] ('''2015'''). ''PAC-Bayes with Minimax for Confidence-Rated Transduction''. [https://arxiv.org/abs/1501.03838 arXiv:1501.03838] <ref>[https://en.wikipedia.org/wiki/Probably_approximately_correct_learning Probably approximately correct learning from Wikipedia]</ref>
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Yoav Freund]] ('''2015'''). ''Optimally Combining Classifiers Using Unlabeled Data''. [https://arxiv.org/abs/1503.01811 arXiv:1503.01811]
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Yoav Freund]] ('''2016'''). ''Muffled Semi-Supervised Learning''. [https://arxiv.org/abs/1605.08833 arXiv:1605.08833]
* [https://scholar.google.com/citations?user=TuA50FUAAAAJ&hl=en Julaiti Alafate], [[Yoav Freund]] ('''2018'''). ''Tell Me Something New: A New Framework for Asynchronous Parallel Learning''. [https://arxiv.org/abs/1805.07483 arXiv:1805.07483]
* [https://scholar.google.com/citations?user=TuA50FUAAAAJ&hl=en Julaiti Alafate], [[Yoav Freund]] ('''2019'''). ''Faster Boosting with Smaller Memory''. [https://arxiv.org/abs/1901.09047 arXiv:1901.09047]
* [https://scholar.google.com/citations?user=LHYUOHoAAAAJ&hl=en Akshay Balsubramani], [[Mathematician#SDasgupta|Sanjoy Dasgupta]], [[Yoav Freund]], [[Mathematician#SMoran|Shay Moran]] ('''2019'''). ''An adaptive nearest neighbor rule for classification''. [https://arxiv.org/abs/1905.12717 arXiv:1905.12717]
==2020 ...==
* [https://scholar.google.com/citations?user=TuA50FUAAAAJ&hl=en Julaiti Alafate], [[Yoav Freund]], [https://scholar.google.com/citations?user=UKfoPcYAAAAJ&hl=en David T. Sandwell], Brook Tozer ('''2020'''). ''Experimental Design for Bathymetry Editing''. [https://arxiv.org/abs/2007.07495 arXiv:2007.07495]
=External Links=
* [http://cseweb.ucsd.edu/~yfreund/ Yoav Freund's Home Page]
* [https://en.wikipedia.org/wiki/Yoav_Freund Yoav Freund from Wikipedia]
* [https://www.mathgenealogy.org/id.php?id=101119 The Mathematics Genealogy Project - Yoav Freund]
* [https://scholar.google.com/citations?user=NFdG-GMAAAAJ Yoav Freund - Google Scholar Citations]
=References=
<references />
'''[[People|Up one Level]]'''
[[Category:Mathematician|Freund]]
[[Category:Researcher|Freund]]
