published: Oct. 12, 2011, recorded: September 2011, views: 4365
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Inspired by the success of compressive sensing, the last three years have seen an explosion of research in the theory of low-rank modeling. By now, we have results stating that it is possible to recover certain low-rank matrices from a minimal number of entries -- or of linear functionals -- by tractable convex optimization. We further know that these methods are robust vis a vis additive noise and even outliers. In a different direction, researchers have developed computationally tractable methods for clustering high-dimensional data points that are assumed to be drawn from multiple low-dimensional linear subspaces. This talk will survey some exciting results in these areas.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !