Coarse sample complexity bounds for active learning

Sanjoy Dasgupta · 2005

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.

Read the paper · More papers on PaperTik