Introduction
We are interested in a number of problems concerning algorithms, randomness, graphs, and information .
Applications include coding, communications, statistical inference, networking, etc.
Below is a sample of our current research projects:
Matrix Completion
Given a matrix M of low-rank, we consider the problem of reconstructing it from a small (and possibly noisy) subset of its entries. The problem arises in a variety of applications such as collaborative filtering, structure-from-motion, and sensor localization. We introduce an efficient and robust algorithm, which we call OptSpace, and provide order-optimal performance guarantees in a number of circumstances.
