34 search results - page 5 / 7 » colt 2005 |
149
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
167
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
160
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
174
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
In recent work Long and Servedio [LS05] presented a “martingale boosting” algorithm that works by constructing a branching program over weak classifiers and has a simple anal...
180
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...