688 citations · 1.9k across the 57 of their papers we have counts for
4 papers · 2 filters
Low-rank Matrix Completion using Alternating Minimization
Prateek Jain, Praneeth Netrapalli, Sujay Sanghavi
Alternating minimization represents a widely applicable and empirically successful approach for finding low-rank matrices that best fit the given data. For example, for the problem…
Improved Graph Clustering
Yudong Chen, Sujay Sanghavi, Huan Xu
Graph clustering involves the task of dividing nodes into clusters, so that the edge density is higher within clusters as opposed to across clusters. A natural, classic and popular…
A New Greedy Algorithm for Multiple Sparse Regression
Ali Jalali, Sujay Sanghavi
This paper proposes a new algorithm for multiple sparse regression in high dimensions, where the task is to estimate the support and values of several (typically related) sparse ve…
Greedy Learning of Markov Network Structure
Praneeth Netrapalli, Siddhartha Banerjee, Sujay Sanghavi +1
We propose a new yet natural algorithm for learning the graph structure of general discrete graphical models (a.k.a. Markov random fields) from samples. Our algorithm finds the nei…