78 citations · 133 across the 3 of their papers we have counts for
3 papers
stat.ML2011★ 53 cited
Finding Dense Clusters via "Low Rank + Sparse" Decomposition
Samet Oymak, Babak Hassibi
Finding "densely connected clusters" in a graph is in general an important and well studied problem in the literature \cite{Schaeffer}. It has various applications in pattern recog…
cs.IT2011★ 2 cited
Subspace Expanders and Matrix Rank Minimization
Amin Khajehnejad, Samet Oymak, Babak Hassibi
Matrix rank minimization (RM) problems recently gained extensive attention due to numerous applications in machine learning, system identification and graphical models. In RM probl…
math.OC2010★ 78 cited
New Null Space Results and Recovery Thresholds for Matrix Rank Minimization
Samet Oymak, Babak Hassibi
Nuclear norm minimization (NNM) has recently gained significant attention for its use in rank minimization problems. Similar to compressed sensing, using null space characterizatio…