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

DOI10.1109/TIT.2020.2992769zbMath1453.90236arXiv1803.07554OpenAlexW3022125780MaRDI QIDQ5138892

Lijun Ding, Yudong Chen

Publication date: 4 December 2020

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

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

zbMATH Keywords

nuclear norm minimization (NNM)iterative stochastic proceduresLeave-One-Out analysislow-rank matrix completion problemsProjected Gradient Descent (PGD)

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Matrix completion problems (15A83)

Related Items

WARPd: A Linearly Convergent First-Order Primal-Dual Algorithm for Inverse Problems with Approximate Sharpness Conditions, Iterative Collaborative Filtering for Sparse Matrix Estimation, GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery, Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs, Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence