Sciweavers

57 search results - page 3 / 12
» Active learning in heteroscedastic noise
Sort
View
JMLR
2010
82views more  JMLR 2010»
13 years 5 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
ALT
2006
Springer
14 years 7 months ago
Active Learning in the Non-realizable Case
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
Matti Kääriäinen
ICDM
2007
IEEE
122views Data Mining» more  ICDM 2007»
14 years 5 months ago
Noise Modeling with Associative Corruption Rules
This paper presents an active learning approach to the problem of systematic noise inference and noise elimination, specifically the inference of Associated Corruption (AC) rules...
Yan Zhang, Xindong Wu
COLT
2007
Springer
14 years 5 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
ICML
2006
IEEE
14 years 11 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...