Rademacher Complexities and Bounding the Excess Risk in Active Learning
Vladimir Koltchinskii; 11(Sep):2457−2485, 2010.
AbstractSequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in the algorithms to estimate the sample sizes needed to achieve the required accuracy of learning in an adaptive way. Probabilistic bounds on the number of active examples have been proved and several applications to binary classification problems are considered.