Suivre
Praneeth Netrapalli
Praneeth Netrapalli
Adresse e-mail validée de google.com - Page d'accueil
Titre
Citée par
Citée par
Année
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
10752013
How to escape saddle points efficiently
C Jin, R Ge, P Netrapalli, SM Kakade, MI Jordan
International Conference on Machine Learning, 1724-1732, 2017
7182017
Phase retrieval using alternating minimization
P Netrapalli, P Jain, S Sanghavi
Advances in Neural Information Processing Systems 26, 2013
6282013
Non-convex robust PCA
P Netrapalli, N UN, S Sanghavi, A Anandkumar, P Jain
Advances in Neural Information Processing Systems 27, 2014
3112014
Morel: Model-based offline reinforcement learning
R Kidambi, A Rajeswaran, P Netrapalli, T Joachims
Advances in neural information processing systems 33, 21810-21823, 2020
2912020
What is local optimality in nonconvex-nonconcave minimax optimization?
C Jin, P Netrapalli, M Jordan
International conference on machine learning, 4880-4889, 2020
265*2020
Accelerated gradient descent escapes saddle points faster than gradient descent
C Jin, P Netrapalli, MI Jordan
Conference On Learning Theory, 1042-1085, 2018
2252018
Learning the graph of epidemic cascades
P Netrapalli, S Sanghavi
ACM SIGMETRICS Performance Evaluation Review 40 (1), 211-222, 2012
2052012
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
1732016
Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification
P Jain, S Kakade, R Kidambi, P Netrapalli, A Sidford
Journal of Machine Learning Research 18, 2018
152*2018
On nonconvex optimization for machine learning: Gradients, stochasticity, and saddle points
C Jin, P Netrapalli, R Ge, SM Kakade, MI Jordan
Journal of the ACM (JACM) 68 (2), 1-29, 2021
143*2021
Information-theoretic thresholds for community detection in sparse networks
J Banks, C Moore, J Neeman, P Netrapalli
Conference on Learning Theory, 383-416, 2016
137*2016
Efficient algorithms for smooth minimax optimization
KK Thekumparampil, P Jain, P Netrapalli, S Oh
Advances in Neural Information Processing Systems 32, 2019
1352019
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
1242016
The pitfalls of simplicity bias in neural networks
H Shah, K Tamuly, A Raghunathan, P Jain, P Netrapalli
Advances in Neural Information Processing Systems 33, 9573-9585, 2020
1232020
Learning sparsely used overcomplete dictionaries
A Agarwal, A Anandkumar, P Jain, P Netrapalli, R Tandon
Conference on Learning Theory, 123-137, 2014
1152014
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
111*2016
The step decay schedule: A near optimal, geometrically decaying learning rate procedure for least squares
R Ge, SM Kakade, R Kidambi, P Netrapalli
Advances in Neural Information Processing Systems 32, 2019
103*2019
Fast exact matrix completion with finite samples
P Jain, P Netrapalli
Conference on Learning Theory, 1007-1034, 2015
982015
Provable efficient online matrix completion via non-convex stochastic gradient descent
C Jin, SM Kakade, P Netrapalli
Advances in Neural Information Processing Systems 29, 2016
952016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20