ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1412.2231
32
203

Generalized Singular Value Thresholding

6 December 2014
Canyi Lu
Changbo Zhu
Chunyan Xu
Shuicheng Yan
Zhouchen Lin
ArXivPDFHTML
Abstract

This work studies the Generalized Singular Value Thresholding (GSVT) operator Proxgσ(⋅){\text{Prox}}_{g}^{{\sigma}}(\cdot)Proxgσ​(⋅), \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 ggg defined on the singular values of XXX. We prove that GSVT can be obtained by performing the proximal operator of ggg (denoted as Proxg(⋅)\text{Prox}_g(\cdot)Proxg​(⋅)) on the singular values since Proxg(⋅)\text{Prox}_g(\cdot)Proxg​(⋅) is monotone when ggg is lower bounded. If the nonconvex ggg satisfies some conditions (many popular nonconvex surrogate functions, e.g., ℓp\ell_pℓp​-norm, 0<p<10<p<10<p<1, of ℓ0\ell_0ℓ0​-norm are special cases), a general solver to find Proxg(b)\text{Prox}_g(b)Proxg​(b) is proposed for any b≥0b\geq0b≥0. 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.

View on arXiv
Comments on this paper