English

Generalized Singular Value Thresholding

Computer Vision and Pattern Recognition 2018-05-29 v2 Machine Learning Numerical Analysis Numerical Analysis

Abstract

This work studies the Generalized Singular Value Thresholding (GSVT) operator Proxgσ(){\text{Prox}}_{g}^{{\sigma}}(\cdot), \begin{equation*} {\text{Prox}}_{g}^{{\sigma}}(B)=\arg\min\limits_{X}\sum_{i=1}^{m}g(\sigma_{i}(X)) + \frac{1}{2}||X-B||_{F}^{2}, \end{equation*} associated with a nonconvex function gg defined on the singular values of XX. We prove that GSVT can be obtained by performing the proximal operator of gg (denoted as Proxg()\text{Prox}_g(\cdot)) on the singular values since Proxg()\text{Prox}_g(\cdot) is monotone when gg is lower bounded. If the nonconvex gg satisfies some conditions (many popular nonconvex surrogate functions, e.g., p\ell_p-norm, 0<p<10<p<1, of 0\ell_0-norm are special cases), a general solver to find Proxg(b)\text{Prox}_g(b) is proposed for any b0b\geq0. GSVT greatly generalizes the known Singular Value Thresholding (SVT) which is a basic subroutine in many convex low rank minimization methods. We are able to solve the nonconvex low rank minimization problem by using GSVT in place of SVT.

Cite

@article{arxiv.1412.2231,
  title  = {Generalized Singular Value Thresholding},
  author = {Canyi Lu and Changbo Zhu and Chunyan Xu and Shuicheng Yan and Zhouchen Lin},
  journal= {arXiv preprint arXiv:1412.2231},
  year   = {2018}
}

Comments

Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2015

R2 v1 2026-06-22T07:22:29.155Z