Sujay Sanghavi
Sujay Sanghavi
Associate Professor, Electrical and Computer Engineering, WNCG, University of Texas, Austin
Verifierad e-postadress på mail.utexas.edu - Startsida
TitelCiteras avÅr
Rank-sparsity incoherence for matrix decomposition
V Chandrasekaran, S Sanghavi, PA Parrilo, AS Willsky
SIAM Journal on Optimization 21 (2), 572-596, 2011
8902011
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
6852013
Robust PCA via outlier pursuit
H Xu, C Caramanis, S Sanghavi
Advances in Neural Information Processing Systems, 2496-2504, 2010
5442010
Phase retrieval using alternating minimization
P Netrapalli, P Jain, S Sanghavi
Advances in Neural Information Processing Systems, 2796-2804, 2013
3902013
A dirty model for multi-task learning
A Jalali, S Sanghavi, C Ruan, PK Ravikumar
Advances in neural information processing systems, 964-972, 2010
3302010
Non-convex robust PCA
P Netrapalli, UN Niranjan, S Sanghavi, A Anandkumar, P Jain
Advances in Neural Information Processing Systems, 1107-1115, 2014
1992014
Distributed link scheduling with constant overhead
S Sanghavi, L Bui, R Srikant
ACM SIGMETRICS Performance Evaluation Review 35 (1), 313-324, 2007
1912007
Low-rank matrix recovery from errors and erasures
Y Chen, A Jalali, S Sanghavi, C Caramanis
IEEE Transactions on Information Theory 59 (7), 4324-4337, 2013
1522013
Sparse and low-rank matrix decompositions
V Chandrasekaran, S Sanghavi, PA Parrilo, AS Willsky
IFAC Proceedings Volumes 42 (10), 1493-1498, 2009
1442009
Gossiping with multiple messages
S Sanghavi, B Hajek, L Massoulié
IEEE Transactions on Information Theory 53 (12), 4640-4654, 2007
1442007
Learning the graph of epidemic cascades
P Netrapalli, S Sanghavi
ACM SIGMETRICS Performance Evaluation Review 40 (1), 211-222, 2012
1402012
Sequential compressed sensing
DM Malioutov, SR Sanghavi, AS Willsky
Selected Topics in Signal Processing, IEEE Journal of 4 (2), 435-444, 2010
1402010
Clustering sparse graphs
Y Chen, S Sanghavi, H Xu
Advances in neural information processing systems, 2204-2212, 2012
1312012
Convergence rates of sub-sampled Newton methods
MA Erdogdu, A Montanari
arXiv preprint arXiv:1508.02810, 2015
118*2015
Intermediate performance of rateless codes
S Sanghavi
2007 IEEE Information Theory Workshop, 478-482, 2007
1142007
Message passing for maximum weight independent set
S Sanghavi, D Shah, AS Willsky
IEEE Transactions on Information Theory 55 (11), 4822-4834, 2009
1072009
Dropping convexity for faster semi-definite optimization
S Bhojanapalli, A Kyrillidis, S Sanghavi
Conference on Learning Theory, 530-582, 2016
1062016
Robust matrix completion and corrupted columns
Y Chen, H Xu, C Caramanis, S Sanghavi
Proceedings of the 28th International Conference on Machine Learning (ICML …, 2011
992011
Clustering partially observed graphs via convex optimization
Y Chen, A Jalali, S Sanghavi, H Xu
The Journal of Machine Learning Research 15 (1), 2213-2238, 2014
902014
Greedy subspace clustering
D Park, C Caramanis, S Sanghavi
Advances in Neural Information Processing Systems, 2753-2761, 2014
842014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20