Unique completability for low-rank matrix completion

Speaker: Professor Nigel Boston (University of Wisconsin)

Date:  Tuesday, 22nd September 2015

Time:  4pm – 5pm

Location:  Agriculture. 1.01 (Seminar Room).

Abstract:

Low-rank matrix completion (LRMC) problems arise in a wide variety of applications. Previous theory mainly provides conditions for completion under missing-at-random samplings. We derive conditions under which there are finitely many/just one rank r matrices that agree with the observed entries. Our approach employs linear algebra and algebraic geometry. Joint work with Daniel Pimentel-Alarcón and Robert Nowak.  

Series: Algebra and Number Theory