34 search results - page 6 / 7 » colt 2005 |
151
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
155
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
144
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. There has been growing interest in practice in using unlabeled data together with labeled data in machine learning, and a number of different approaches have been develo...
155
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
153
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...