**JOINT CSML & PACM COLLOQUIUM**

^{Completing large low rank matrices with only few observed entries: A one-line algorithm with provable guarantees.}

**Abstract:** Suppose you observe very few entries from a large matrix. Can we predict the missing entries, say assuming the matrix is (approximately) low rank ? We describe a very simple method to solve this matrix completion problem. We show our method is able to recover matrices from very few entries and/or with ill conditioned matrices, where many other popular methods fail. Furthermore, due to its simplicity, it is easy to extend our method to incorporate additional

knowledge on the underlying matrix, for example to solve the inductive matrix completion problem. On the theoretical front, we prove that our method enjoys some of the strongest available theoretical recovery guarantees. Finally, for inductive matrix completion, we prove that under suitable conditions the problem

has a benign optimization landscape with no bad local minima. Joint work with Pini Zilber.

**Bio: **Boaz Nadler received his Ph.D. at Tel Aviv University. After 3 years as a Gibbs instructor/assistant professor at Yale University. He joined the faculty at the department of computer science and applied mathematics at the Weizmann Institute of Science. His research interests span mathematical statistics, machine learning and various applications, including optics and signal processing.

------------------------------------------------------------------------------------------------------------------------------------

NEXT: Monday, October 3 , 2022 – PACM Colloquium- Prof. Dustin Mixon, Ohio State University.