Timezone: »

Matrix Completion from Noisy Entries
Raghunandan Keshavan · Andrea Montanari · Sewoong Oh

Tue Dec 08 07:00 PM -- 11:59 PM (PST) @ None #None

Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the ‘Netflix problem’) to structure-from-motion and positioning. We study a low complexity algorithm introduced in [1], based on a combination of spectral techniques and manifold optimization, that we call here OPTSPACE. We prove performance guarantees that are order-optimal in a number of circumstances.

Author Information

Raghunandan Keshavan (Stanford University)
Andrea Montanari (Stanford)
Sewoong Oh (UIUC)

More from the Same Authors