Bayesian active learning using arbitrary binary valued queries

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

Volumn 6331 LNAI, Issue , 2010, Pages 50-58

  Yang, Liu ^a   Hanneke, Steve ^b   Carbonell, Jaime ^a  

^a Carnegie Mellon University ^*  (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Active Learning; Bayesian Learning; Information Theory; Sample Complexity

Indexed keywords

ACTIVE LEARNING; BAYESIAN; BAYESIAN LEARNING; EXPECTED RISK; SAMPLE COMPLEXITY; UPPER AND LOWER BOUNDS;

INFORMATION THEORY;

BAYESIAN NETWORKS;

EID: 78249243073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16108-7_8     Document Type: Conference Paper

References (11)

1. Bshouty, N.H., Li, Y., Long, P.M.: Using the doubling dimension to analyze the generalization of learning algorithms. Journal of Computer and System Sciences 75, 323-335 (2009)
2. Cover, T.M., Thomas, J.A.: Elements of information theory. John Wiley & Sons, Inc., Chichester (2006)
3. Dasgupta, S.: Coarse sample complexity bounds for active learning. In: Advances in Neural Information Processing Systems, vol. 18 (2005)
4. Freund, Y., Seung, H.S., Shamir, E., Tishby, N.: Selective sampling using the query by committee algorithm. Machine Learning 28, 133-168 (1997) (Pubitemid 127506338)
5. Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and lowdistortion mbeddings. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003)
6. Hanneke, S.: A bound on the label complexity of agnostic active learning. In: Proceedings of the 24th International Conference on Machine Learning (2007a)
7. Hanneke, S.: Teaching dimension and the complexity of active learning. In: Proceedings of the 20th Annual Conference on Learning Theory (2007b)
8. Haussler, D., Kearns, M., Schapire, R.: Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension. Machine Learning 14, 83-113 (1994a)
9. Haussler, D., Littlestone, N., Warmuth, M.: Predicting {0, 1}-functions on randomly drawn points. Information and Computation 115, 248-292 (1994b)
10. Kulkarni, S.R., Mitter, S.K., Tsitsiklis, J.N.: Active learning using arbitrary binary valued queries. Machine Learning 11, 23-35 (1993)
11. Seung, H.S., Opper, M., Sompolinsky, H.: Query by committee. In: Proceedings of the 5th Workshop on Computational Learning Theory (1992)