46 search results - page 7 / 10 » colt 2008 |
COLT
2008
Springer
13 years 8 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
COLT
2008
Springer
13 years 7 months ago
2008
Springer
The problem of how a teacher and a learner can cooperate in the process of learning concepts from examples in order to minimize the required sample size without “coding tricksâ€...
COLT
2008
Springer
13 years 8 months ago
2008
Springer
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...