A graphical approach to the analysis of matrix completion
From MaRDI portal
Recommendations
- Exact matrix completion via convex optimization
- A simpler approach to matrix completion
- A rank-corrected procedure for matrix completion with fixed basis coefficients
- Nuclear norm regularization with a low-rank constraint for matrix completion
- A Singular Value Thresholding Algorithm for Matrix Completion
Cites work
- A simpler approach to matrix completion
- Exact matrix completion via convex optimization
- Freedman's inequality for matrix martingales
- Matrix Completion From a Few Entries
- Matrix completion from noisy entries
- Matrix estimation by universal singular value thresholding
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Spectral regularization algorithms for learning large incomplete matrices
- Sums of random Hermitian matrices and an inequality by Rudelson
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(4)
This page was built for publication: A graphical approach to the analysis of matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q335673)