Generalized Singular Value Thresholding

PROCEEDINGS OF THE TWENTY-NINTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE(2015)

引用 204|浏览371
暂无评分
摘要
This work studies the Generalized Singular Value Thresholding (GSVT) operator Prox(g)(sigma) (.),Prox(g)(sigma) (B) = arg minX Sigma(m)(i =1) g(sigma(i) (X)) vertical bar 1/2 vertical bar vertical bar X -B vertical bar vertical bar(2)(F),associated with a nonconvex function g defined on the singular values of X. We prove that GSVT can be obtained by performing the proximal operator of g (denoted as Prox(g) (.)) on the singular values since Prox(g) (.) is monotone when g is lower bounded. If the nonconvex g satisfies some conditions (many popular nonconvex surrogate functions, e.g., l(p)-norm, 0 < p < 1, of l(0)-norm are special cases), a general solver to find Prox(g) (b) is proposed for any b >= 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.
更多
查看译文
关键词
singular value
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要