Skip to main content
guest
Join
|
Help
|
Sign In
chessprogramming
Home
guest
|
Join
|
Help
|
Sign In
Wiki Home
Recent Changes
Pages and Files
Members
Home
Basics
Getting Started
Board Representation
Search
Evaluation
Principle Topics
Chess
Programming
Artificial Intelligence
Knowledge
Learning
Testing
Tuning
User Interface
Protocols
Dictionary
Lists
Arts
Cartoons
CC Forums
Conferences
Dedicated CC
Engines
Games
Hardware
History
Organizations
Papers
People
Periodical
Samples
Software
Timeline
Tournaments and Matches
Videos
Misc
Acknowledgments
On New Pages
Recommended Reading
Wikispaces Help
Yoav Freund
Edit
0
10
…
2
Tags
mathematician
people
Notify
RSS
Backlinks
Source
Print
Export (PDF)
Home
*
People
* Yoav Freund
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]
Table of Contents
Selected Publications
1990 ...
1995 ...
2000 ...
2005 ...
2010 ...
2015 ...
External Links
References
What links here?
Selected Publications
[6]
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 2-Layer 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
,
CiteSeerX
1995 ...
Yoav Freund
.(
1995
).
Boosting a weak learning algorithm by majority
.
Information and Computation
, Vol. 121, No. 2,
pdf
Yoav Freund
,
Robert Schapire
(
1996
).
Game Theory, On-line Prediction and Boosting
.
COLT 1996
,
pdf
Yoav Freund
(
1996
).
Predicting a Binary Sequence Almost As Well As the Optimal Biased Coin
.
COLT 1996
,
pdf
Nicolò Cesa-Bianchi
,
Yoav Freund
,
David P. Helmbold
,
Manfred K. Warmuth
(
1996
).
On-line Prediction and Conversion Strategies
.
Machine Learning
, Vol. 25, No 1,
pdf
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
»
AdaBoost
Nicolò Cesa-Bianchi
,
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ò Cesa-Bianchi
,
Yoav Freund
,
Robert Schapire
(
1998
).
Gambling in a rigged casino: The adversarial multi-arm 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
,
pdf
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
[7]
Peter Auer
,
Nicolò Cesa-Bianchi
,
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
2010 ...
Yoav Freund
(
2010
).
Data winnowing
.
KDD 2010
,
abstract as pdf
Robert Schapire
,
Yoav Freund
(
2012
).
Boosting: Foundations and Algorithms
.
MIT Press
Akshay Balsubramani
,
Sanjoy Dasgupta
,
Yoav Freund
(
2013
).
The Fast Convergence of Incremental PCA
.
arXiv:1501.03796
[8]
2015 ...
Akshay Balsubramani
,
Yoav Freund
(
2015
).
PAC-Bayes with Minimax for Confidence-Rated Transduction
.
arXiv:1501.03838
[9]
Akshay Balsubramani
,
Yoav Freund
(
2015
).
Optimally Combining Classifiers Using Unlabeled Data
.
arXiv:1503.01811
External Links
Yoav Freund's Home Page
Yoav Freund from Wikipedia
The Mathematics Genealogy Project - Yoav Freund
Yoav Freund | LinkedIn
Yoav Freund - Google Scholar Citations
References
^
The Mathematics Genealogy Project - Yoav Freund
^
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
^
Data Winnowing Abstract - Bio
(pdf)
^
Peter Auer
,
Nicolò Cesa-Bianchi
,
Yoav Freund
,
Robert Schapire
(
1998
).
Gambling in a rigged casino: The adversarial multi-arm bandit problem
.
NeuroCOLT2
,
pdf
^
Yoav Freund's Home Page
^
dblp: Yoav Freund
^
[Learning] Reminder: Learning Games and Brownian Motion
by
Yoav Freund
, September 30, 2003
^
Principal component analysis from Wikipedia
^
Probably approximately correct learning from Wikipedia
What links here?
Page
Date Edited
Games
Feb 20, 2018
Learning
Feb 20, 2018
Mathematician
Apr 9, 2018
Minimax
Dec 29, 2017
Neural Networks
Mar 12, 2018
Nicolò Cesa-Bianchi
May 30, 2015
People
Feb 28, 2018
Peter Auer
May 29, 2015
Robert Schapire
Jun 1, 2015
University of California, Santa Cruz
Oct 23, 2017
Wee Sun Lee
May 29, 2015
Yoav Freund
Sep 20, 2015
Up one Level
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
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].
Table of Contents
Selected Publications
[6]1990 ...
1995 ...
2000 ...
2005 ...
2010 ...
2015 ...
External Links
References
What links here?
Up one Level