Search Results for author:
Found 2 papers, 1 papers with code
Provable Low Rank Plus Sparse Matrix Separation Via Nonconvex Regularizers
This paper considers a large class of problems where we seek to recover a low rank matrix and/or sparse vector from some set of measurements.
Low-Rank Factorization for Rank Minimization with Nonconvex Regularizers
Rank minimization is of interest in machine learning applications such as recommender systems and robust principal component analysis.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
