The following pages link to Sujay Sanghavi (Q747720):
Displayed 21 items.
- Serving content with unknown demand: the high-dimensional regime (Q747721) (← links)
- The local convexity of solving systems of quadratic equations (Q2410810) (← links)
- Completing Any Low-rank Matrix, Provably (Q2788394) (← links)
- Online Collaborative Filtering on Graphs (Q2830757) (← links)
- (Q2934076) (← links)
- Matrix Completion With Column Manipulation: Near-Optimal Sample-Robustness-Rank Tradeoffs (Q2977082) (← links)
- Improved Greedy Algorithms for Learning Graphical Models (Q2977445) (← links)
- Improved Graph Clustering (Q2986111) (← links)
- Rank-Sparsity Incoherence for Matrix Decomposition (Q3093595) (← links)
- Gossiping With Multiple Messages (Q3548820) (← links)
- (Q4558537) (← links)
- Learning Graphical Models for Hypothesis Testing and Classification (Q4570611) (← links)
- Phase Retrieval Using Alternating Minimization (Q4580795) (← links)
- Message Passing for Maximum Weight Independent Set (Q4974041) (← links)
- A New Mechanism for the Free-Rider Problem (Q4974232) (← links)
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
- Robust PCA via Outlier Pursuit (Q5271969) (← links)
- Belief Propagation and LP Relaxation for Weighted Matching in General Graphs (Q5280978) (← links)
- A Dirty Model for Multiple Sparse Regression (Q5346202) (← links)
- Tighter Low-rank Approximation via Sampling the Leveraged Element (Q5362997) (← links)
- Low-rank matrix completion using alternating minimization (Q5495837) (← links)