148 search results - page 21 / 30 » Bounds for Linear Multi-Task Learning |
COLT
2000
Springer
13 years 12 months ago
2000
Springer
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
NIPS
2001
13 years 9 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
IV
2010
IEEE
13 years 6 months ago
2010
IEEE
In this article we present an infrastructure for creating mash up visual representations of the user profile that combines data from different sources. We explored this approach ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
NN
1997
Springer
13 years 11 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...