A general agnostic active learning algorithm

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Dasgupta, Sanjoy ^a   Hsu, Daniel ^a   Monteleoni, Claire ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

% REDUCTIONS; ACTIVE LEARNING; ACTIVE-LEARNING ALGORITHM; AGNOSTIC SETTING; DATA DISTRIBUTION; FALL BACKS; GENERALIZATION BOUND; SIMPLE SCHEMES; SIMPLE++; VC-DIMENSION;

LEARNING ALGORITHMS;

EID: 85161987046     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15(2):201-221, 1994.
2. Y. Freund, H. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2):133-168, 1997. (Pubitemid 127506338)
3. S. Dasgupta, A. Kalai, and C. Monteleoni. Analysis of perceptron-based active learning. In COLT, 2005.
4. S. Dasgupta. Coarse sample complexity bounds for active learning. In NIPS, 2005.
5. S. Hanneke. Teaching dimension and the complexity of active learning. In COLT, 2007.
6. M.-F. Balcan, A. Broder, and T. Zhang. Margin based active learning. In COLT, 2007.
7. R. Castro and R. Nowak. Upper and lower bounds for active learning. In Allerton Conference on Communication, Control and Computing, 2006.
8. R. Castro and R. Nowak. Minimax bounds for active learning. In COLT, 2007.
9. M.-F. Balcan, A. Beygelzimer, and J. Langford. Agnostic active learning. In ICML, 2006.
10. S. Dasgupta, D. Hsu, and C. Monteleoni. A general agnostic active learning algorithm. UCSD Technical Report CS2007-0898, http://www.cse.ucsd.edu/ ~djhsu/papers/cal.pdf, 2007.
11. M. Kääriäinen. Active learning in the non-realizable case. In ALT, 2006.
12. S. Hanneke. A bound on the label complexity of agnostic active learning. In ICML, 2007.
13. C. Monteleoni. Learning with online constraints: shifting concepts and active learning. PhD Thesis, MIT Computer Science and Artificial Intelligence Laboratory, 2006.
14. O. Bousquet, S. Boucheron, and G. Lugosi. Introduction to statistical learning theory. Lecture Notes in Artificial Intelligence, 3176:169-207, 2004. (Pubitemid 39741632)
15. V. Vapnik and A. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.
16. C. Monteleoni. Efficient algorithms for general active learning. In COLT. Open problem, 2006.
17. V. Guruswami and P. Raghavendra. Hardness of learning halfspaces with noise. In FOCS, 2006.