Classification with Low Rank and Missing Data

  title={Classification with Low Rank and Missing Data},
  author={Elad Hazan and Roi Livni and Yishay Mansour},
We consider classification and regression tasks where we have missing data and assume that the (clean) data resides in a low rank subspace. Finding a hidden subspace is known to be computationally hard. Nevertheless, using a non-proper formulation we give an efficient agnostic algorithm that classifies as good as the best linear classifier coupled with the best low-dimensional subspace in which the data resides. A direct implication is that our algorithm can linearly (and non-linearly through… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
11 Citations
21 References
Similar Papers

Similar Papers

Loading similar papers…