Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966)

scientific article; zbMATH DE number 7271856

Language	Label	Description	Also known as
English	Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization	scientific article; zbMATH DE number 7271856

Statements

instance of

scholarly article

0 references

title

Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (English)

0 references

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

9 November 2020

0 references

full work available at URL

https://arxiv.org/abs/1902.07698

0 references

zbMATH Keywords

matrix completion

0 references

minimaxity

0 references

stability

0 references

convex relaxation

0 references

nonconvex optimization

0 references

Burer-Monteiro approach

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Entrywise eigenvector analysis of random matrices with low expected rank

0 references

Blind Deconvolution Using Convex Programming

0 references

Confidence Intervals for Diffusion Index Forecasts and Inference for Factor-Augmented Regressions

0 references

Problems of distance geometry and convex properties of quadratic maps

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

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

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

Fast and provable algorithms for spectrally sparse signal reconstruction via low-rank Hankel matrix completion

0 references

Matrix completion via max-norm constrained optimization

0 references

Robust principal component analysis?

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

Exact matrix completion via convex optimization

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Poisson Matrix Recovery and Completion

0 references

Rank-Sparsity Incoherence for Matrix Decomposition

0 references

Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA

0 references

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

0 references

Incoherence-Optimal Matrix Completion

0 references

The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

0 references

Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

0 references

Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices

0 references

Robust Spectral Compressed Sensing via Structured Matrix Completion

0 references

Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval

0 references

Spectral method and regularized MLE are both optimal for top-$K$ ranking

0 references

Inference and uncertainty quantification for noisy matrix completion

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Correlation and Large-Scale Simultaneous Significance Testing

0 references

On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators

0 references

Estimating False Discovery Proportion Under Arbitrary Covariance Dependence

0 references

FarmTest: Factor-Adjusted Robust Multiple Testing With Approximate False Discovery Control

0 references

Factor-Adjusted Regularized Model Selection

0 references

Large Covariance Estimation by Thresholding Principal Orthogonal Complements

0 references

Robust covariance estimation for approximate factor models

0 references

Sufficient forecasting using factor models

0 references

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization

0 references

Recovering Low-Rank Matrices From Few Coefficients in Any Basis

0 references

Low-rank matrix completion using alternating minimization

0 references

Blind Demixing and Deconvolution at Near-Optimal Rate

0 references

Matrix Completion From a Few Entries

0 references

Q2896128

0 references

Noisy low-rank matrix completion with general sampling distribution

0 references

Factor models and variable selection in high-dimensional regression analysis

0 references

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

0 references

Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization

0 references

Approximate support recovery of atomic line spectral estimation: a tale of resolution and precision

0 references

Self-calibration and biconvex compressive sensing

0 references

Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds

0 references

Interior-Point Method for Nuclear Norm Approximation with Application to System Identification

0 references

Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution

0 references

Fixed point and Bregman iterative methods for matrix rank minimization

0 references

Q2896145

0 references

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

0 references

``Preconditioning'' for feature selection and regression in high-dimensional problems

0 references

A Simpler Approach to Matrix Completion

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Estimation of high-dimensional low-rank matrices

0 references

Matrix Completion With Deterministic Pattern: A Geometric Perspective

0 references

Angular synchronization by eigenvectors and semidefinite programming

0 references

Theory of semidefinite programming for sensor network localization

0 references

Learning Theory

0 references

Guaranteed Matrix Completion via Non-Convex Factorization

0 references

The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square

0 references

Q3161693

0 references

Low-Rank Matrix Completion by Riemannian Optimization

0 references

Guarantees of Riemannian Optimization for Low Rank Matrix Recovery

0 references

Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm

0 references

Q4637073

0 references

Near-Optimal Bounds for Phase Synchronization

0 references

Identifiers

zbMATH Open document ID

1477.90060

0 references

DOI

10.1137/19M1290000

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5131966