Matrix completion with sparse measurement errors

DOI10.1007/S10092-022-00500-6MaRDI QIDQ2685993zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 23 February 2023

Published in Calcolo (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10092-022-00500-6

zbMATH Keywords

matrix completionrestricted isometry propertyprojected gradientlow rank plus sparseSVD perturbation

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Recommendations

• Sparse precision matrix estimation with missing observations
• Structured matrix estimation and completion
• Sparse recovery under matrix uncertainty
• Matrix completion problems
• Matrix Completion under Low-Rank Missing Mechanism
• Sparse recovery from inaccurate saturated measurements
• Sparse principal component analysis with measurement errors
• Some empirical advances in matrix completion
• Matrix completion from noisy entries
• Matrix completion under interval uncertainty

Cites work

• A simpler approach to matrix completion
• Compressive Multiplexing of Correlated Signals
• Convex multi-task feature learning
• Geometric Methods on Low-Rank Matrix and Tensor Manifolds
• Guarantees of Riemannian optimization for low rank matrix completion
• Guarantees of Riemannian optimization for low rank matrix recovery
• Low-rank approximation algorithms for matrix completion with random sampling
• Low-rank matrix completion by Riemannian optimization
• Matrix completion by singular value thresholding: sharp bounds
• Perturbation bounds in connection with singular value decomposition
• Some new bounds on perturbation of subspaces
• Subspaces, angles and pairs of orthogonal projections
• The complexity of matrix completion
• Tutorial on large deviations for the binomial distribution

Cited in

(10)

• Enhancing matrix completion using a modified second-order total variation
• Approximate method of variational Bayesian matrix factorization/completion with sparse prior
• Matrix completion from noisy entries
• Regularization methods for low-rank factorization of matrices with missing data
• A gradient system for low rank matrix completion
• A kind of ill-posed inverse problem solving with sparsity constraint
• Matrix completion with column outliers and sparse noise
• Error bounds for sparse and low-rank matrix approximation based on restricted isometric properties
• Constructing low-rank Tucker tensor approximations using generalized completion
• Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit

This page was built for publication: Matrix completion with sparse measurement errors

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