Sciweavers

JMLR
2010
82views more  JMLR 2010»
12 years 12 months ago
Negative Results for Active Learning with Convex Losses
We study the problem of active learning with convex loss functions. We prove that even under bounded noise constraints, the minimax rates for proper active learning are often no b...
Steve Hanneke, Liu Yang
NIPS
2008
13 years 6 months ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang
ICDM
2009
IEEE
149views Data Mining» more  ICDM 2009»
13 years 11 months ago
Accelerated Gradient Method for Multi-task Sparse Learning Problem
—Many real world learning problems can be recast as multi-task learning problems which utilize correlations among different tasks to obtain better generalization performance than...
Xi Chen, Weike Pan, James T. Kwok, Jaime G. Carbon...