Analysis of perceptron-based active learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3559 LNAI, Issue , 2005, Pages 249-263

  Dasgupta, Sanjoy ^a   Kalai, Adam Tauman ^b   Monteleoni, Claire ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR ANALYSIS; LEARNING ALGORITHMS; NEURAL NETWORKS; PROBLEM SOLVING;

PERCEPTRON ALGORITHMS; PERCEPTRON-BASED ACTIVE LEARNING; SELECTIVE SAMPLING ALGORITHM; SUPERVISED LEARNING;

LEARNING SYSTEMS;

EID: 26944439047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11503415_17     Document Type: Conference Paper

References (12)

1. D. Angluin. Queries revisited. In Proc. 12th Int. Conference on Algorithmic Learning Theory, LNAI,2225:12-31, 2001.
2. E. B. Baum. The perceptron algorithm is fast for nonmalicious distributions. Neural Computation, 2:248-260, 1997.
3. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial-time algorithm for learning noisy linear threshold functions. In Proc. 37th IEEE Symposium on the Foundations of Computer Science, 1996.
4. N. Cesa-Bianchi, C. Gentile, and L. Zaniboni. Worst-case analysis of selective sampling for linear-threshold algorithms. In Advances in Neural Information Processing Systems 17, 2004.
5. S. Dasgupta. Analysis of a greedy active learning strategy. In Advances in Neural Information Processing Systems 17. 2004.
6. S. Fine, R. Gilad-Bachrach, and E. Shamir. Query by committee, linear separation and random walks. Theoretical Computer Science, 284(1):25-51, 2002.
7. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168, 1997.
8. R. Gilad-Bachrach, A. Navot, and N. Tishby. Kernel query by committee (KQBC). Technical Report 2003-88, Leibniz Center, the Hebrew University, 2003.
9. D. D. Lewis and W. A. Gale. A sequential algorithm for training text classifiers. In Proc. of SIGIR-94, 17th ACM International Conference on Research and Development in Information Retrieval, 1994.
10. P. M. Long. On the sample complexity of PAC learning halfspaces against the uniform distribution. IEEE Transactions on Neural Networks, 6(6):1556-1559, 1995.
11. P. M. Long. An upper bound on the sample complexity of PAC learning halfspaces with respect to the uniform distribution. Information Processing Letters, 87(5):229-23, 2003.
12. R. A. Servedio. On PAC learning using winnow, perceptron, and a perceptron-like algorithm. In Computational Learning Theory, pages 296-307, 1999.