Raghunandan Keshavan
Raghunandan Keshavan
Electrical Engineering, Stanford Univeristy
Verified email at stanford.edu
Title
Cited by
Cited by
Year
Matrix completion from a few entries
RH Keshavan, A Montanari, S Oh
IEEE transactions on information theory 56 (6), 2980-2998, 2010
11382010
Matrix completion from noisy entries
R Keshavan, A Montanari, S Oh
Advances in neural information processing systems, 952-960, 2009
6562009
A gradient descent algorithm on the grassman manifold for matrix completion
RH Keshavan, S Oh
arXiv preprint arXiv:0910.5260, 2009
1062009
Efficient algorithms for collaborative filtering
RH Keshavan
Stanford University, 2012
592012
Low-rank matrix completion with noisy observations: a quantitative comparison
RH Keshavan, A Montanari, S Oh
2009 47th Annual Allerton Conference on Communication, Control, and …, 2009
392009
Regularization for matrix completion
RH Keshavan, A Montanari
2010 IEEE International Symposium on Information Theory, 1503-1507, 2010
232010
Learning low rank matrices from O (n) entries
RH Keshavan, A Montanari, S Oh
2008 46th Annual Allerton Conference on Communication, Control, and …, 2008
162008
Matrix completion from noisy entries, 2009
RH Keshavan, A Montanari, S Oh
arXiv preprint arXiv:0906.2027, 0
8
Matrix completion from a few entries. 2009
RH Keshavan, A Montanari, S Oh
Preprint available at http://arxiv. org/abs/0901.3150, 0
5
Generating random Tanner-graphs with large girth
M Bayati, R Keshavan, A Montanari, S Oh, A Saberi
2009 IEEE Information Theory Workshop, 154-157, 2009
22009
Optspace: a matrix completion algorithm
RH Keshavan, A Montanari, S Oh
2
The system can't perform the operation now. Try again later.
Articles 1–11