Praneeth Netrapalli
Praneeth Netrapalli
Microsoft Research
Verified email at microsoft.com - Homepage
Title
Cited by
Cited by
Year
Low-rank matrix completion using alternating minimization
P Jain, P Netrapalli, S Sanghavi
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
8302013
Phase retrieval using alternating minimization
P Netrapalli, P Jain, S Sanghavi
Advances in Neural Information Processing Systems, 2796-2804, 2013
4782013
How to escape saddle points efficiently
C Jin, R Ge, P Netrapalli, SM Kakade, MI Jordan
arXiv preprint arXiv:1703.00887, 2017
4032017
Non-convex robust PCA
P Netrapalli, UN Niranjan, S Sanghavi, A Anandkumar, P Jain
Advances in Neural Information Processing Systems, 1107-1115, 2014
2422014
Learning the graph of epidemic cascades
P Netrapalli, S Sanghavi
ACM SIGMETRICS Performance Evaluation Review 40 (1), 211-222, 2012
1622012
Learning sparsely used overcomplete dictionaries via alternating minimization
A Agarwal, A Anandkumar, P Jain, P Netrapalli
SIAM Journal on Optimization 26 (4), 2775-2799, 2016
1472016
Accelerated gradient descent escapes saddle points faster than gradient descent
C Jin, P Netrapalli, MI Jordan
Conference On Learning Theory, 1042-1085, 2018
1192018
Information-theoretic thresholds for community detection in sparse networks
J Banks, C Moore, J Neeman, P Netrapalli
Conference on Learning Theory, 383-416, 2016
101*2016
Learning sparsely used overcomplete dictionaries
A Agarwal, A Anandkumar, P Jain, P Netrapalli, R Tandon
Conference on Learning Theory, 123-137, 2014
1012014
Streaming PCA: Matching matrix Bernstein and near-optimal finite sample guarantees for Oja’s algorithm
P Jain, C Jin, SM Kakade, P Netrapalli, A Sidford
Conference on learning theory, 1147-1164, 2016
99*2016
Faster eigenvector computation via shift-and-invert preconditioning
D Garber, E Hazan, C Jin, C Musco, P Netrapalli, A Sidford
International Conference on Machine Learning, 2626-2634, 2016
89*2016
Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification
P Jain, P Netrapalli, SM Kakade, R Kidambi, A Sidford
The Journal of Machine Learning Research 18 (1), 8258-8299, 2017
82*2017
Accelerating stochastic gradient descent for least squares regression
P Jain, SM Kakade, R Kidambi, P Netrapalli, A Sidford
Conference On Learning Theory, 545-604, 2018
81*2018
A clustering approach to learning sparsely used overcomplete dictionaries
A Agarwal, A Anandkumar, P Netrapalli
IEEE Transactions on Information Theory 63 (1), 575-592, 2016
79*2016
Fast exact matrix completion with finite samples
P Jain, P Netrapalli
Conference on Learning Theory, 1007-1034, 2015
762015
Provable efficient online matrix completion via non-convex stochastic gradient descent
C Jin, SM Kakade, P Netrapalli
Advances in Neural Information Processing Systems, 4520-4528, 2016
692016
What is local optimality in nonconvex-nonconcave minimax optimization?
C Jin, P Netrapalli, MI Jordan
arXiv preprint arXiv:1902.00618, 2019
66*2019
One-bit compressed sensing: Provable support and vector recovery
S Gopi, P Netrapalli, P Jain, A Nori
International Conference on Machine Learning, 154-162, 2013
662013
Greedy learning of Markov network structure
P Netrapalli, S Banerjee, S Sanghavi, S Shakkottai
2010 48th Annual Allerton Conference on Communication, Control, and …, 2010
512010
Efficient algorithms for large-scale generalized eigenvector computation and canonical correlation analysis
R Ge, C Jin, P Netrapalli, A Sidford
International Conference on Machine Learning, 2741-2750, 2016
492016
The system can't perform the operation now. Try again later.
Articles 1–20