What Do Unique Games, Structural Biology and the Low-Rank Matrix Completion Problem Have In Common
published: July 30, 2009, recorded: June 2009, views: 6156
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.
We will formulate several data-driven applications as MAX2LIN and d-to-1 games, and show how to (approximately) solve them using efficient spectral and semidefinite program relaxations. The relaxations perform incredibly well in the presence of a large number of outlier measurements that cannot be satisfied. We use random matrix theory to prove that the algorithms almost achieve the information theoretic Shannon bound. The underlying group structure of the different applications (like SO(2), SO(3), GL(n), etc.) is heavily exploited. Applications include: cryo-electron microscopy and NMR spectroscopy for 3D protein structuring, low-rank matrix completion, clock synchronization, and surface reconstruction in computer vision and optics. Partly joint with Yoel Shkolnisky, Ronald Coifman and Fred Sigworth (Yale); Mihai Cucuringu and Yaron Lipman (Princeton); and Yosi Keller (Bar Ilan).
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !