Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank Matrix Completion

Shuai Zhang University of California, Irvine Penghang Yin University of California, Irvine Jack Xin University of California, Irvine

Information Theory mathscidoc:1802.19003

Comm. Math Sci, 15, (3), 839-862, 2017
We study a non-convex low-rank promoting penalty function, the transformed Schatten- 1 (TS1), and its applications in matrix completion. The TS1 penalty, as a matrix quasi-norm defined on its singular values, interpolates the rank and the nuclear norm through a nonnegative parameter a∈ (0,+∞). We consider the unconstrained TS1 regularized low-rank matrix recovery problem and develop a fixed point representation for its global minimizer. The TS1 thresholding functions are in closed analytical form for all parameter values. The TS1 threshold values differ in subcritical (supercritical) parameter regime where the TS1 threshold functions are continuous (discontinuous). We propose TS1 iterative thresholding algorithms and compare them with some state-of-the-art algorithms on matrix completion test problems. For problems with known rank, a fully adaptive TS1 iterative thresholding algorithm consistently performs the best under different conditions, where ground truth matrices are generated by multivariate Gaussian, (0,1) uniform and Chi-square distributions. For problems with unknown rank, TS1 algorithms with an additional rank estimation procedure approach the level of IRucL-q which is an iterative reweighted algorithm, non-convex in nature and best in performance.
No keywords uploaded!
[ Download ] [ 2018-02-14 11:26:05 uploaded by jack ] [ 434 downloads ] [ 0 comments ]
  title={Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank Matrix Completion},
  author={Shuai Zhang, Penghang Yin, and Jack Xin},
  booktitle={Comm. Math Sci},
Shuai Zhang, Penghang Yin, and Jack Xin. Transformed Schatten-1 Iterative Thresholding Algorithms for Low Rank Matrix Completion. 2017. Vol. 15. In Comm. Math Sci. pp.839-862.
Please log in for comment!
Contact us: | Copyright Reserved