59 search results - page 1 / 12 » Minimax Bounds for Active Learning |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
JMLR
2010
12 years 11 months ago
2010
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...
ALT
1999
Springer
13 years 9 months ago
1999
Springer
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
ALT
2002
Springer
14 years 1 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...