148 search results - page 15 / 30 » Bounds for Linear Multi-Task Learning |
COLT
2004
Springer
14 years 29 days ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
ML
2002
ACM
13 years 7 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We describe and analyze efficient algorithms for learning a linear predictor from examples when the learner can only view a few attributes of each training example. This is the ca...
COLT
2001
Springer
14 years 1 days ago
2001
Springer
We describe a new boosting algorithm which generates only smooth distributions which do not assign too much weight to any single example. We show that this new boosting algorithm ...