Coarse sample complexity bounds for active learning 论文

2005引用 256
Machine Learning and AlgorithmsAlgorithms and Data CompressionOptimization and Search Problems

摘要

We characterize the sample complexity of active learning problems in terms of a parameter which takes into account the distribution over the input space, the specific target hypothesis, and the desired accuracy.