A graphical approach to the analysis of matrix completion
From MaRDI portal
Publication:335673
DOI10.1016/J.SPA.2016.04.007zbMATH Open1388.15025OpenAlexW2345050207MaRDI QIDQ335673FDOQ335673
Authors: Tingni Sun, Cun-Hui Zhang 
Publication date: 2 November 2016
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spa.2016.04.007
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
Convex programming (90C25) Estimation in multivariate analysis (62H12) Applications of mathematical programming (90C90) Matrix completion problems (15A83)
Cites Work
- Matrix completion from noisy entries
- Spectral regularization algorithms for learning large incomplete matrices
- Matrix estimation by universal singular value thresholding
- Exact matrix completion via convex optimization
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
- Matrix Completion From a Few Entries
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- A Simpler Approach to Matrix Completion
- Freedman's inequality for matrix martingales
- Sums of random Hermitian matrices and an inequality by Rudelson
Cited In (3)
Uses Software
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)
