Matrix Completion via Convex Optimization: Theory and Algorithms thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Matrix Completion via Convex Optimization: Theory and Algorithms

Published on Jul 30, 200924385 Views

This talk considers a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. In partially filled out surveys, for instance, we would like to infer th

Related categories