Minimax Bounds for Active Learning

13 years 3 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 information gleaned from previous samples in order to focus the sampling and accelerate the learning process relative to “passive learning” algorithms, which are based on non-adaptive (usually random) samples. There are a number of empirical and theoretical results suggesting that in certain situations active learning can be significantly more effective than passive learning. However, the fact that active learning algorithms are feedback systems makes their theoretical analysis very challenging. This paper aims to shed light on achievable limits in active learning. Using minimax analysis techniques, we study the achievable rates of classification error convergence for broad classes of distributions characterized by decision boundary regularity and noise conditions. The results clearly indicate the conditions...
Rui Castro, Robert D. Nowak
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where COLT
Authors Rui Castro, Robert D. Nowak
Comments (0)