Agnostic active learning

Journal of Computer and System Sciences

Volumn 75, Issue 1, 2009, Pages 78-89

  Balcan, Maria Florina ^a   Beygelzimer, Alina ^b   Langford, John ^c  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c YAHOO RESEARCH   (United States)

Author keywords

Active learning; Agnostic setting; Linear separators; Sample complexity

Indexed keywords

CLASSIFIERS;

ACTIVE LEARNING; ACTIVE-LEARNING ALGORITHM; AGNOSTIC SETTING; LINEAR SEPARATORS; OPTIMAL CLASSIFIERS; SAMPLE COMPLEXITY; THRESHOLD CLASSIFIERS; UNDERLYING DISTRIBUTION;

LEARNING ALGORITHMS;

EID: 56349166999     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2008.07.003     Document Type: Article

References (35)

1. Angluin D. Queries and concept learning. Mach. Learn. 2 (1998) 319-342
2. Angluin D. Queries revisited. Theoret. Comput. Sci. 313 2 (2004) 175-194
3. Anthony M., and Bartlett P. Neural Network Learning: Theoretical Foundations (1999), Cambridge University Press
4. M.-F. Balcan, A. Blum, A PAC-style model for learning from labeled and unlabeled data, in: Proceedings of the 18th Annual Conference on Computational Learning Theory (COLT), 2005
5. M.-F. Balcan, A. Broder, T. Zhang, Margin based active learning, in: Proceedings of the 20th Annual Conference on Computational Learning Theory (COLT), 2007
6. M.-F. Balcan, E. Even-Dar, S. Hanneke, M. Kearns, Y. Mansour, J. Wortman, Asymptotic active learning, in: Workshop on Principles of Learning Design Problem, in Conjunction with the 21st Annual Conference on Neural Information Processing Systems (NIPS), 2007
7. M.-F. Balcan, S. Hanneke, J. Wortman, The true sample complexity of active learning, in: Proceedings of the 21st Annual Conference on Computational Learning Theory (COLT), 2008
8. E. Baum, K. Lang, Query learning can work poorly when a human oracle is used, in: Proceedings of the IEEE International Joint Conference on Neural Networks, 1993
9. A. Blum, S. Chawla, Learning from labeled and unlabeled data using graph mincuts, in: Proceedings of the 18th International Conference on Machine Learning (ICML), 2001
10. A. Blum, T. Mitchell, Combining labeled and unlabeled data with co-training, in: The 11th Annual Conference on Computational Learning Theory (COLT), 1998
11. Blumer A., Ehrenfeucht A., Haussler D., and Warmuth M. Occam's razor. Inform. Process. Lett. 24 (1987) 377-380
12. Bousquet O., Boucheron S., and Lugosi G. Theory of classification: A survey of recent advances. ESAIM Probab. Stat. 9 (2005) 323-375
13. Bshouty N.H., and Eiron N. Learning monotone dnf from a teacher that almost does not answer membership queries. J. Mach. Learn. Res. 3 (2002) 49-57
14. Burnashev M., and Zigangirov K. An interval estimation problem for controlled observations. Probl. Inf. Transm. 10 (1974) 223-231
15. R. Castro, R. Nowak, Minimax bounds for active learning, in: Proceedings of the 20th Annual Conference on Computational Learning Theory (COLT), 2007
16. Castro R., Willett R., and Nowak R. Faster rates in regression via active learning. Adv. Neural Inform. Process. Systems 18 (2006)
17. Chapelle O., Schölkopf B., and Zien A. Semi-Supervised Learning (2006), MIT Press
18. D. Cohn, L. Atlas, R. Ladner, Improving generalization with active learning, in: Proceedings of the 15th International Conference on Machine Learning (ICML), 1994, pp. 201-221
19. Czyzowicz J., Mundici D., and Pelc A. Ulam's searching game with lies. J. Combin. Theory Ser. A 52 (1989) 62-76
20. Dasgupta S. Analysis of a greedy active learning strategy. Adv. Neural Inform. Process. Systems 17 (2004)
21. Dasgupta S. Coarse sample complexity bounds for active learning. Adv. Neural Inform. Process. Systems 18 (2005)
22. Dasgupta S., Hsu D.J., and Monteleoni C. A general agnostic active learning algorithm. Adv. Neural Inform. Process. Systems 20 (2007)
23. S. Dasgupta, A. Kalai, C. Monteleoni, Analysis of perceptron-based active learning, in: Proceedings of the 18th Annual Conference on Computational Learning Theory (COLT), 2005
24. Freund Y., Seung H.S., Shamir E., and Tishby N. Selective sampling using the query by committee algorithm. Mach. Learn. 28 2-3 (1997) 133-168
25. S. Hanneke, A bound on the label complexity of agnostic active learning, in: Proceedings of the 24th Annual International Conference on Machine Learning (ICML), 2007
26. Jackson J. An efficient membership-query algorithm for learning dnf with respect to the uniform distribution. J. Comput. System Sci. 57 3 (1995) 414-440
27. T. Joachims, Transductive inference for text classification using support vector machines, in: Proceedings of the 16th International Conference on Machine Learning (ICML), 1999, pp. 200-209
28. M. Kääriäinen, On active learning in the non-realizable case, in: Proceedings of 17th International Conference on Algorithmic Learning Theory (ALT), 2006
29. A. Levin, P. Viola, Y. Freund, Unsupervised improvement of visual detectors using co-training, in: Proceedings of the 9th International Conference on Computer Vision (ICCV), 2003
30. Long P.M. On the sample complexity of PAC learning halfspaces against the uniform distribution. IEEE Trans. Neural Networks 6 6 (1995) 1556-1559
31. T. Mitchell, The discipline of machine learning, Technical Report CMU ML-06 108, 2006
32. Nigam K., McCallum A., Thrun S., and Mitchell T.M. Text classification from labeled and unlabeled documents using EM. Mach. Learn. 39 2/3 (2000) 103-134
33. Park S.B., and Zhang B.T. Co-trained support vector machines for large scale unstructured document classification using unlabeled data and syntactic information. Inform. Process. Manag. 40 3 (2004) 421-439
34. Vapnik V., and Chervonenkis A. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16 2 (1971) 264-280
35. Vapnik V.N. Statistical Learning Theory (1998), John Wiley and Sons