图 书 馆
独特的游戏，结构生物学和低秩矩阵完成问题有什么共同之处What Do Unique Games, Structural Biology and the Low-Rank Matrix Completion Problem Have In Common |
|
| 课程网址: | http://videolectures.net/mlss09us_singer_wdugsblrmcphic/ |
| 主讲教师: | Amit Singer |
| 开课单位: | 普林斯顿大学 |
| 开课时间: | 2009-07-30 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | 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). |
| 关 键 词: | 数据驱动应用程序; 半定程序; 随机矩阵理论 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-07-18：cjy |
| 阅读次数: | 58 |