A Deterministic Theory of Low Rank Matrix Completion

DOI10.1109/TIT.2020.3019569zbMath1457.15027arXiv1910.01079OpenAlexW3080832086MaRDI QIDQ5138947

Sourav Chatterjee

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/1910.01079

zbMATH Keywords

asymptotic solutiongraph limit theorymodification of Candès-Recht nuclear norm minimization algorithm

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Matrix completion problems (15A83)

Related Items

A universal rank approximation method for matrix completion ⋮ Deterministic Tensor Completion with Hypergraph Expanders

This page was built for publication: A Deterministic Theory of Low Rank Matrix Completion