Learning with missing features

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence, UAI 2011

Volumn , Issue , 2011, Pages 635-642

  Rostamizadeh, Afshin ^a   Agarwal, Alekh ^a   Bartlett, Peter ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RELAXATION PROCESSES;

BATCH ALGORITHMS; CONVEX RELAXATION; IMPUTATION METHODS; MISSING FEATURES; NONCONVEX PROBLEM; ON-LINE SETTING; RADEMACHER COMPLEXITY; STANDARD SETTING;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. J. Abernethy, A. Agarwal, P. L. Bartlett, and A. Rakhlin. A stochastic view of optimal regret through minimax duality. CoRR, abs/0903.5328, 2009.
2. P.L. Bartlett and S. Mendelson. Rademacher and Gaussian complexities: Risk bounds and structural results. JMLR, 3, 2003.
3. A. Beck and M. Teboulle. Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31(3), 2003.
4. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambr. Univ. Press, 2006.
5. N. Cesa-Bianchi, S. Shalev-Shwartz, and O. Shamir. Efficient learning with partially observed attributes. ICML, 2010.
6. N. Cesa-Bianchi, S.S. Shwartz, and O. Shamir. Online Learning of Noisy Data with Kernels. COLT, 2010.
7. G. Chechik, G. Heitz, G. Elidan, P. Abbeel, and D. Koller. Max-margin classification of data with absent features. JMLR, 9, 2008.
8. T.M. Cover and E. Ordentlich. Universal portfolios with side information. Information Theory, IEEE Transactions on, 42(2):348-363, mar 1996. (Pubitemid 126770492)
9. O. Dekel, O. Shamir, and L. Xiao. Learning to classify with missing and corrupted features. Machine learning, 2010.
10. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journ. of the Royal Stat. Society, 39(1), 1977.
11. A. Globerson and S. Roweis. Nightmare at test time: robust learning by feature deletion. In ICML, 2006.
12. E. Hazan and N. Megiddo. Online learning with prior information. In COLT, 2007.
13. K. Krishnan and J.E. Mitchell. Semi-infinite linear programming approaches to semidefinite programming problems. Novel approaches to hard discrete optimization problems, 37, 2003.
14. R.J.A. Little and D.B. Rubin. Statistical analysis with missing data. Wiley New York, 1987.
15. B. M. Marlin. Missing Data Problems in Machine Learning. PhD thesis, University of Toronto, 2008.
16. A. S. Nemirovski and D. B. Yudin. Problem Complexity and Method Efficiency in Optimization. 1983.
17. A. Rostamizadeh, A. Agarwal, and P. Bartlett. Online and Batch Learning Algorithms for Data with Missing Features. ArXiv e-prints, 2011.