In this paper, we propose a new approach to solve low-rank tensor completion and robust tensor PCA. Our approach is based on some novel notion of (even-order) tensor ranks, to be called the M-rank, the symmetric M-rank, and the strongly symmetric M-rank. We discuss the connections between these new tensor ranks and the CP-rank and the symmetric CP-rank of an even-order tensor. We show that the M-rank provides a reliable and easy-computable approximation to the CP-rank. As a result, we propose to replace the CP-rank by the M-rank in the low-CP-rank tensor completion and robust tensor PCA. Numerical results suggest that our new approach based on the M-rank outperforms existing methods that are based on low-n-rank, t-SVD, and KBR approaches for solving low-rank tensor completion and robust tensor PCA when the underlying tensor has low CP-rank.
|Original language||English (US)|
|Number of pages||15|
|Journal||IEEE Journal on Selected Topics in Signal Processing|
|State||Published - Dec 2018|
Bibliographical noteFunding Information:
Manuscript received April 13, 2018; revised August 3, 2018; accepted September 26, 2018. Date of publication October 1, 2018; date of current version December 17, 2018. The work of B. Jiang was supported in part by the National Natural Science Foundation of China under Grants 11771269 and 11831002 and in part by the Program for Innovative Research Team of Shanghai University of Finance and Economics. The work of S. Ma was supported by a startup package in the Department of Mathematics at UC Davis. The work of S. Zhang was supported in part by the National Science Foundation under Grant CMMI-1462408 and in part by the Shenzhen Fundamental Research Fund under Grant KQTD2015033114415450. The guest editor coordinating the review of this paper and approving it for publication was Prof. Thierry Bouwmans. (Corresponding author: Shiqian Ma.) B. Jiang is with the Research Institute for Interdisciplinary Sciences, School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai 200433, China (e-mail:,firstname.lastname@example.org).
- Low-rank tensor completion
- matrix unfolding
- robust tensor PCA