Low-rank matrix recovery under heavy-tailed errors
From MaRDI portal
Publication:6565325
DOI10.3150/23-BEJ1675MaRDI QIDQ6565325
Myeonghun Yu, Qiang Sun, Wen-Xin Zhou
Publication date: 2 July 2024
Published in: Bernoulli (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Estimation of high-dimensional low-rank matrices
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Oracle inequalities and optimal inference under group sparsity
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Robust matrix completion
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- Convex multi-task feature learning
- Reduced-rank regression for the multivariate linear model
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Robust regression: Asymptotics, conjectures and Monte Carlo
- Compressed sensing and matrix completion with constant proportion of corruptions
- Robust low-rank matrix estimation
- Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
- Noisy low-rank matrix completion with general sampling distribution
- Exact matrix completion via convex optimization
- Guarantees of Riemannian optimization for low rank matrix recovery
- A Singular Value Thresholding Algorithm for Matrix Completion
- Adaptive Huber Regression
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,∞ Regularization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Estimation of High Dimensional Mean Regression in the Absence of Symmetry and Light Tail Assumptions
- Robust reduced-rank regression
- Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
This page was built for publication: Low-rank matrix recovery under heavy-tailed errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565325)