A graphical approach to the analysis of matrix completion

DOI10.1016/j.spa.2016.04.007zbMath1388.15025OpenAlexW2345050207MaRDI QIDQ335673

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

zbMATH Keywords

sample sizematrix completionobservations

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Convex programming (90C25) Applications of mathematical programming (90C90) Matrix completion problems (15A83)

Uses Software

• softImpute

Cites Work

• Unnamed Item
• Unnamed Item
• Sums of random Hermitian matrices and an inequality by Rudelson
• Freedman's inequality for matrix martingales
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Matrix estimation by universal singular value thresholding
• Exact matrix completion via convex optimization
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• Matrix Completion From a Few Entries
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• A Simpler Approach to Matrix Completion
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise

This page was built for publication: A graphical approach to the analysis of matrix completion