Efficient learning with partially observed attributes

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 183-190

  Cesa Bianchi, Nicolò ^a   Shalev Shwartz, Shai ^a   Shamir, Ohad ^b  

^a UNIVERSITY OF MILAN   (Italy)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DIGIT RECOGNITION; EFFICIENT ALGORITHM; EFFICIENT LEARNING; LINEAR PREDICTORS; MEDICAL RESEARCH; PREDICTION ACCURACY; TRAINING EXAMPLE;

ALGORITHMS;

LEARNING SYSTEMS;

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

References (26)

1. P. Auer, N. Cesa-Bianchi, Y. Freund, and R.E. Schapire. The nonstochastic multiarmed bandit problem. SIAM Journal on Computing, 32, 2003.
2. M-F Balean, A. Beygelzimer, and J. Langford. Agnostic active learning. In ICML, 2006.
3. S. Ben-David and E. Dichterman. Learning with restricted focus of attention. Journal of Computer and System Sciences, 56, 1998.
4. A. Beygelzimer, S. Dasgupta, and J. Langford. Importance weighted active learning. In ICML, 2009.
5. R. Calderbank, S. Jafarpour, and R. Schapire. Compressed learning: Universal sparse dimensionality reduction and learning in the measurement domain. Manuscript, 2009.
6. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
7. N. Cesa-Bianchi, A. Conconi, and C. Gentile. On the generalization ability of on-line learning algorithms. IEEE Transactions on Information Theory, 50(9): 2050-2057, September 2004.
8. N. Cesa-Bianchi, S. Shalev-Shwartz, and O. Shamir. Efficient Learning with Partially Observed Attributes. Technical Report, available at arXiv:1004.4421.
9. D. Cohn, L. Atlas, and R. Ladner. Improving generalization with active learning. Machine Learning, 15: 201-221, 1994.
10. Y. Le Cun, L. Bottou, Y. Bengio, and P. Haffner. Gradient-based learning applied to document recognition. Proceedings of IEEE, 86(11):2278-2324, November 1998.
11. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. J. Royal Statist. Soc. B, 39:1-38, 1977.
12. K. Deng, C. Bourke, S. Scott, J. Sunderman, and Y. Zheng. Bandit-based algorithms for budgeted learning. In ICDM, 2007.
13. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, 1996.
14. i-ball for learning in high dimensions. In ICML, 2008.
15. C. Dwork. Differential privacy: A survey of results. In M. Agrawal, D.-Z. Du, Z. Duan, and A. Li, editors, TAMC, volume 4978 of Lecture Notes in Computer Science, pages 1-19. Springer, 2008.
16. R. Greiner, A. Grove, and D. Roth. Learning cost-sensitive active classifiers. Artificial Intelligence, 139 (2):137-174, 2002.
17. S. Hanneke. A bound on the label complexity of agnostic active learning. In ICML, 2007.
18. S. Hanneke. Adaptive rates of convergence in active learning. In COLT, 2009.
19. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1): 78-150, 1992.
20. E. Hazan, A. Kalai, S. Kale, and A. Agarwal. Logarithmic regret algorithms for online convex optimization. In ICML, 2006.
21. S. Kakade and S. Shalev-Shwartz. Mind the duality gap: Logarithmic regret algorithms for online optimization. In NIPS, 2008.
22. A. Kapoor and R. Greiner. Learning and classifying under hard budgets. In ECML, 2005.
23. S. Shalev-Shwartz, Y. Singer, and N. Srebro. Pegasos: Primal Estimated sub-GrAdient SOlver for SVM. In ICML, 2007.
24. R. Tibshirani. Regression shrinkage and selection via the lasso. J. Royal Statist. Soc. B, 58(1):267-288, 1996.
25. V. N. Vapnik. Statistical Learning Theory. Wiley, 1998.
26. S. Zhou, J. Lafferty, and L. Wasserman. Compressed and privacy-sensitive sparse regression. IEEE Trans, on Information Theory, 55(2):846-866, 2009.