COLT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
COLT
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
COLT
2007
Springer
13 years 9 months ago
2007
Springer
We study generalized bootstrapped confidence regions for the mean of a random vector whose coordinates have an unknown dependence structure, with a non-asymptotic control of the co...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study online regret minimization algorithms in a bicriteria setting, examining not only the standard notion of regret to the best expert, but also the regret to the av...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
COLT
2007
Springer
13 years 11 months ago
2007
Springer
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We describe and analyze a new approach for feature ranking in the presence of categorical features with a large number of possible values. It is shown that popular ranking criteria...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
COLT
2007
Springer
13 years 11 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper the concept of asymptotic complexity of languages is introduced. This concept formalises the notion of learnability in a particular environment and generali...