Noisy low-rank matrix completion under general bases

DOI10.1002/STA4.303MaRDI QIDQ6541602FDOQ6541602

Authors: Lei Shi, Changliang Zou 

Publication date: 19 May 2024

Published in: Stat (Search for Journal in Brave)

zbMATH Keywords

high-dimensional datanuclear norm penalizationerror boundleast squares estimator

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Matrix completion from noisy entries
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Noisy low-rank matrix completion with general sampling distribution
• Exact matrix completion via convex optimization
• Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Restricted strong convexity and weighted matrix completion: optimal bounds with noise
• Estimation of high-dimensional low-rank matrices
• Compressed sensing
• An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
• Inverse Eigenvalue Problems
• Rank penalized estimators for high-dimensional matrices
• Recovering Low-Rank Matrices From Few Coefficients in Any Basis
• A simpler approach to matrix completion
• Quantum tomography via compressed sensing: error bounds, sample complexity and efficient estimators
• Minimax bounds for sparse PCA with noisy high-dimensional data
• Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion

This page was built for publication: Noisy low-rank matrix completion under general bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6541602)