Video URL

https://old.simons.berkeley.edu/node/22589

A Deterministic Theory of Low Rank Matrix Completion

(2022). A Deterministic Theory of Low Rank Matrix Completion. The Simons Institute for the Theory of Computing. https://old.simons.berkeley.edu/node/22589

A Deterministic Theory of Low Rank Matrix Completion. The Simons Institute for the Theory of Computing, Sep. 27, 2022, https://old.simons.berkeley.edu/node/22589 

          @misc{ scivideos_22589,
            doi = {},
            url = {https://old.simons.berkeley.edu/node/22589},
            author = {},
            keywords = {},
            language = {en},
            title = {A Deterministic Theory of Low Rank Matrix Completion},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2022},
            month = {sep},
            note = {22589 see, \url{https://scivideos.org/simons-institute/22589}}
          }
Sourav Chatterjee (Stanford University)
Source Repository Simons Institute
Subject

Abstract

Abstract   The problem of completing a large low rank matrix using a subset of revealed entries has received much attention in the last ten years. I will give 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. I will also present an algorithm that is able to approximately recover the matrix whenever recovery is possible.