A deterministic theory of low rank matrix completion

10 Jul 2020 Chatterjee Sourav

The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. The main result of this paper gives a necessary and sufficient condition, stated in the language of graph limit theory, for a sequence of matrix completion problems with arbitrary missing patterns to be asymptotically solvable... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • STATISTICS THEORY
  • COMBINATORICS
  • PROBABILITY
  • STATISTICS THEORY