报告人：魏钶  研究员（复旦大学）


时间：2022年10月13日，9:30-10:30


腾讯会议 ID：164-528-190


摘要：

This talk is concerned with the low Tucker-rank tensor completion problem, which is about reconstructing a tensor from partial revealed entries. Riemannian optimization algorithms based on the Tucker decomposition and the tensor train decommission will be discussed. On the one hand, the exact recovery guarantee of the vanilla Riemannian gradient algorithm based on the Tucker decomposition will be established. On the other hand, we will discuss the quotient geometry of the low tensor train rank tensors under a preconditioned metric as well as the corresponding Riemannian optimization algorithms.


邀请人：张雷洪