Robust Matrix Completion with Heavy-Tailed Noise (Q6970803)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Robust Matrix Completion with Heavy-Tailed Noise

scientific article; zbMATH DE number 8053512

Language	Label	Description	Also known as
default for all languages	No label defined
English	Robust Matrix Completion with Heavy-Tailed Noise	scientific article; zbMATH DE number 8053512

Statements

instance of

scholarly article

0 references

title

Robust Matrix Completion with Heavy-Tailed Noise (English)

0 references

0 references

0 references

Journal of the American Statistical Association

0 references

publication date

17 June 2025

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions

0 references

Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions

0 references

Asymptotic Theory of Least Absolute Error Regression

0 references

Empirical risk minimization for heavy-tailed losses

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Robust low-rank matrix completion by Riemannian optimization

0 references

Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Challenging the empirical mean and empirical variance: a deviation study

0 references

Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs

0 references

A Deterministic Theory of Low Rank Matrix Completion

0 references

Nonconvex Rectangular Matrix Completion via Gradient Descent Without <i>ℓ</i>₂,<sub>∞</sub> Regularization

0 references

Incoherence-Optimal Matrix Completion

0 references

Inference and uncertainty quantification for noisy matrix completion

0 references

Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization

0 references

Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Empirical properties of asset returns: stylized facts and statistical issues

0 references

Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis

0 references

Robust low-rank matrix estimation

0 references

Estimation of High Dimensional Mean Regression in the Absence of Symmetry and Light Tail Assumptions

0 references

A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery

0 references

Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Understanding alternating minimization for matrix completion

0 references

Loss minimization and parameter estimation with heavy tails

0 references

Robust regression: Asymptotics, conjectures and Monte Carlo

0 references

Low-rank matrix completion using alternating minimization

0 references

Matrix Completion From a Few Entries

0 references

Noisy low-rank matrix completion with general sampling distribution

0 references

Robust matrix completion

0 references

Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion

0 references

On the convex geometry of blind deconvolution and matrix completion

0 references

Nonconvex Robust Low-Rank Matrix Recovery

0 references

Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators

0 references

Low-rank matrix completion and denoising under Poisson noise

0 references

Geometric median and robust estimation in Banach spaces

0 references

Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries

0 references

Restricted strong convexity and weighted matrix completion: optimal bounds with noise

0 references

Q3967358

0 references

Matrix Completion With Deterministic Pattern: A Geometric Perspective

0 references

Adaptive Huber Regression

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number

0 references

A high-dimensional nonparametric multivariate test for mean vector

0 references

Guarantees of Riemannian optimization for low rank matrix recovery

0 references

Q4166064

0 references

Matrix completion with noisy entries and outliers

0 references

Statistical Inferences of Linear Forms for Noisy Matrix Completion

0 references

Inference for heteroskedastic PCA with missing data

0 references

Identifiers

DOI

10.1080/01621459.2024.2375037

0 references

Mathematics Subject Classification ID

62-XX

0 references

zbMATH DE Number

8053512

0 references

Sitelinks

Mathematics(1 entry)

mardi Robust Matrix Completion with Heavy-Tailed Noise