COLT
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. We investigate the generalization behavior of sequential prediction (online) algorithms, when data are generated from a probability distribution. Using some newly develop...
COLT
2005
Springer
13 years 6 months ago
2005
Springer
Category ranking is the task of ordering labels with respect to their relevance to an input instance. In this paper we describe and analyze several algorithms for online category r...
COLT
2005
Springer
13 years 6 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
COLT
2005
Springer
13 years 10 months ago
2005
Springer
COLT
2005
Springer
13 years 10 months ago
2005
Springer
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
COLT
2005
Springer
13 years 10 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...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a generalization of the Perceptron algorithm. The new algorithm performs a Perceptron-style update whenever the margin of an example is smaller than a predefi...