148 search results - page 7 / 30 » Bounds for Linear Multi-Task Learning |
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the problem of classification in nonadaptive dimensionality reduction. Specifically, we bound the increase in classification error of Fisher’s Linear Discriminant...
COLT
2007
Springer
15 years 3 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
90
Voted
CC
2010
Springer
14 years 7 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
NIPS
2004
14 years 11 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
NIPS
2004
14 years 11 months ago
2004
We present a novel approach to collaborative prediction, using low-norm instead of low-rank factorizations. The approach is inspired by, and has strong connections to, large-margi...