Speaker: 蔡剑锋副教授,香港科技大学数学系
Time: Dec 7, 2015, 10:00-11:00
Location: 科研教学服务中心703
We establish theoretical recovery guarantees of a family of Riemannian optimization algorithms for low rank matrix recovery, which is about recovering an m×n rank r matrix from p<mn number of linear measurements. The algorithms are first interpreted as the iterative hard thresholding algorithms with subspace projections.... |