arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.05944cs.ITmath.IT
收藏

关于加权核范数极小化的凸几何

On the Convex Geometry of Weighted Nuclear Norm Minimization

Seyedroohollah Hosseini

摘要:

低秩矩阵逼近是一种从观测值构造低秩矩阵的方法,近年来受到广泛关注。解决这一问题的一个有效方法是将秩最小化问题转化为核范数最小化问题。然而,软阈值的奇异值导致消除的重要信息感测矩阵。加权核范数最小化(WNNM)已经被提出,其中奇异值被分配不同的权重,以便不同地处理奇异值。本文利用凸几何与压缩感知算法之间的联系,在特定的加权条件下分析了WNNM的解。结果表明,WNNM是凸的权重是在非降序,有一个唯一的全局极小值的最小化问题。

英文摘要:

Low-rank matrix approximation, which aims to construct a low-rank matrix from an observation, has received much attention recently. An efficient method to solve this problem is to convert the problem of rank minimization into a nuclear norm minimization problem. However, soft-thresholding of singular values leads to the elimination of important information about the sensed matrix. Weighted nuclear norm minimization (WNNM) has been proposed, where the singular values are assigned different weights, in order to treat singular values differently. In this paper the solution for WNNM is analyzed under a particular weighting condition using the connection between convex geometry and compressed sensing algorithms. It is shown that the WNNM is convex where the weights are in non-descending order and there is a unique global minimizer for the minimization problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑