Home * People * Yoav Freund
YoavFreund.jpg

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 [1]. He is most famous for his work with Robert Schapire on boosting and the formulation of the AdaBoost algorithm [2], awarded with the 2003 Gödel prize in theoretical computer science, and with the Paris Kanellakis Prize in 2004 [3]. Further, along with Peter Auer and Nicolò Cesa-Bianchi, Yoav Freund and Robert Schapire worked on multi-armed bandit problems [4].
Yoav Freund [5]

Selected Publications

[6]

1990 ...

1995 ...

2000 ...

2005 ...

2010 ...

2015 ...


External Links


References

  1. ^ The Mathematics Genealogy Project - Yoav Freund
  2. ^ Yoav Freund, Robert Schapire (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, Vol. 55, No. 1, 1996 pdf
  3. ^ Data Winnowing Abstract - Bio (pdf)
  4. ^ Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, Robert Schapire (1998). Gambling in a rigged casino: The adversarial multi-arm bandit problem. NeuroCOLT2, pdf
  5. ^ Yoav Freund's Home Page
  6. ^ dblp: Yoav Freund
  7. ^ [Learning] Reminder: Learning Games and Brownian Motion by Yoav Freund, September 30, 2003
  8. ^ Principal component analysis from Wikipedia
  9. ^ Probably approximately correct learning from Wikipedia

What links here?


Up one Level