Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,∞ Regularization

DOI10.1109/TIT.2020.2992234zbMath1448.90078arXiv1901.06116OpenAlexW2918965983MaRDI QIDQ5124543

No author found.

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.06116

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Matrix completion problems (15A83)

Related Items (5)

GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery ⋮ Inference for low-rank completion without sample splitting with application to treatment effect estimation ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data ⋮ Unnamed Item

This page was built for publication: Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,_∞ Regularization