Robust selective sampling from single and multiple teachers

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 346-358

  Dekel, Ofer ^a   Gentile, Claudio ^b   Sridharan, Karthik ^c  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF INSUBRIA   (Italy)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE-LEARNING ALGORITHM; ONLINE LEARNING ALGORITHMS; POOL-BASED; SELECTIVE SAMPLING;

LEARNING ALGORITHMS;

SAMPLING;

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

References (31)

1. Azoury, K. S., & Warmuth, M. K. (2001). Relative loss bounds for online density estimation with the exponential family of distributions. Machine Learning, 43, 211-246.
2. Bach, F. (2006). Active learning for misspecified generalized linear models (Technical Report N15/06/MM). Ecole des mines de Paris.
3. Balcan, M., Beygelzimer, M., & Langford, J. (2006). Agnostic active learning. Proc. of the 23th International Conference on Machine Learning (pp. 65-72).
4. Balcan, M., Broder, A., & T. Zhang, T. (2007). Margin-based active learning. Proc. of the 20th Annual Conference on Learning Theory (pp. 35-50).
5. Castro, R., & Nowak, R. D. (2008). Minimax bounds for active learning. IEEE Trans. IT, 54, 2339-2353.
6. Cavallanti, G., Cesa-Bianchi, N., & Gentile, C. (2009). Linear classification and selective sampling under low noise conditions. Advances in Neural Information Processing Systems 21.
7. Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2003). Learning probabilistic linear-threshold classifiers via selective sampling. Proc. of the 16th Annual Conference on Learning Theory (pp. 373-387).
8. Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2005). A second-order Perceptron algorithm. SIAM Journal on Computing, 43, 640-668.
9. Cesa-Bianchi, N., & Gentile, C. (2008). Improved risk tail bounds for on-line algorithms. IEEE Trans. IT, 54, 386-390.
10. Cesa-Bianchi, N., Gentile, C., & Orabona, F. (2009). Robust bounds for classification via selective sampling. Proc. of the 26th International Conference on Machine Learning.
11. Cesa-Bianchi, N., Gentile, C., & Zaniboni, L. (2006). Worst-case analysis of selective sampling for linear classification. JMLR, 7, 1025-1230.
12. Cesa-Bianchi, N., & Lugosi, G. (2006). Prediction, learning, and games. Cambridge University Press.
13. Cohn, R., Atlas, L., & Ladner, R. (1990). Training connectionist networks with queries and selective sampling. Advances in Neural Information Processing Systems 2.
14. Dani, V., and Hayes., T. P., & Kakade, S. M. (2008). Stochastic linear optimization under bandit feedback. Proc. of the 12th Annual Conference on Learning Theory.
15. Dasgupta, S., Hsu, D., & Monteleoni, C. (2008). A general agnostic active learning algorithm. Advances in Neural Information Processing Systems 21.
16. Dasgupta, S., and Kalai., A. T., & Monteleoni, C. (2005). Analysis of perceptron-based active learning. Proc. of the 18th Annual Conference on Learning Theory.
17. Dekel, O., Gentile, C., & Sridharan, K. (2010). Robust selective sampling from single and multiple teachers (Technical Report). Microsoft Research, Università dell'Insubria, TTI.
18. Donmez, P., & Carbonell, J. G. (2008). Proactive learning: Cost-sensitive active learning with multiple imperfect oracles. CIKM.
19. Freund, Y., Seung, S., Shamir, E., & Tishby, N. (1997). Selective sampling using the query by committee algorithm. Machine Learning, 28, 133-168.
20. Hanneke, S. (2007). A bound on the label complexity of agnostic active learning. Proc. of the 24th International Conference on Machine Learning (pp. 353-360).
21. Hanneke, S. (2009). Adaptive rates of convergence in active learning. Proc. of the 22th Annual Conference on Learning Theory.
22. Hazan, E., Kalai, A., Kale, S., & Agarwal, A. (2006). Logarithmic regret algorithms for online convex optimization. Proc. of the 19th Annual Conference on Learning Theory.
23. Hoerl, A., & Kennard, R. (1970). Ridge regression: Biased estimation for nonorthogonal problems. Technometrics, 12, 55-67.
24. Kakade, S., & Tewari, A. (2008). On the generalization ability of online strongly convex programming algorithms. Advances in Neural Information Processing Systems.
25. Lai, T. L., & Wei, C. Z. (1982). Least squares estimates in stochastic regression models with applications to identification and control of dynamic systems. The Annals of Statistics, 154-166.
26. Li, L., Littman, M., & Walsh, T. (2008). Knows what it knows: a framework for self-aware learning. Proc. of the 25th International Conference on Machine Learning (pp. 568-575).
27. Strehl, A., & Littman, M. (2008). Online linear regression and its application to model-based reinforcement learning. Advances in Neural Information Processing Systems 20.
28. Tsybakov, A. (2004). Optimal aggregation of classifiers in statistical learning. Ann. of Stat., 32, 135-166.
29. Vovk, V. (2001). Competitive on-line statistics. International Statistical Review, 69, 213-248.
30. Yang, L., & Carbonell, J. (2009a). Adaptive proactive learning with cost-reliability tradeoff (Technical Report CMU-ML-09-114). Carnegie Mellon University.
31. Yang, L., & Carbonell, J. (2009b). Cost complexity of proactive learning via a reduction to realizable active learning (Technical Report CMU-ML-09-113). Carnegie Mellon University.