Robust matrix completion
From MaRDI portal
Publication:682808
DOI10.1007/s00440-016-0736-yzbMath1383.62167arXiv1412.8132OpenAlexW2963831709MaRDI QIDQ682808
Karim Lounici, Olga Klopp, Alexandre B. Tsybakov
Publication date: 5 February 2018
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.8132
Related Items
Color Image Inpainting via Robust Pure Quaternion Matrix Completion: Error Bound and Weighted Loss, All-in-one robust estimator of the Gaussian mean, Tight risk bound for high dimensional time series completion, Optimal cleaning for singular values of cross-covariance matrices, A generalized non-convex method for robust tensor completion, High-dimensional VAR with low-rank transition, Outlier detection in networks with missing links, Robust low-rank matrix estimation, Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries, Matrix factorization for multivariate time series analysis, Main effects and interactions in mixed and incomplete data frames, Matrix optimization based Euclidean embedding with outliers, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Robust Low-Rank Matrix Completion by Riemannian Optimization, Multidimensional linear functional estimation in sparse Gaussian models and robust estimation of the mean, Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone, Unnamed Item, Nonlocal robust tensor recovery with nonconvex regularization *, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix completion via max-norm constrained optimization
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Statistics for high-dimensional data. Methods, theory and applications.
- Estimation of high-dimensional low-rank matrices
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Hanson-Wright inequality and sub-Gaussian concentration
- Absolute and monotonic norms
- Compressed sensing and matrix completion with constant proportion of corruptions
- Noisy low-rank matrix completion with general sampling distribution
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- Robust PCA via Outlier Pursuit
- Robust Matrix Decomposition With Sparse Corruptions
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- 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
- Introduction to nonparametric estimation
