arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.5901math.OC
收藏

使用Ky Fan $2$ - $k$ -norm和$\ell_1$ -norm寻找最大的低秩集群

Finding the largest low-rank clusters with Ky Fan $2$-$k$-norm and $\ell_1$-norm

Xuan Vinh Doan, Stephen Vavasis

摘要:

我们提出了一个凸优化公式与Ky Fan $2$ -norm和$\ell_1$ -norm找到$k$最大的近似秩1的子矩阵块的一个给定的非负矩阵,具有低秩块对角结构的噪声。我们分析了低秩和稀疏结构的最优解使用这两个矩阵范数的性质。我们表明,在一定的假设下,具有很高的概率,该方法可以恢复秩一子矩阵块,即使它们被随机噪声破坏,并插入到一个更大的矩阵与其他随机噪声块。

英文摘要:

We propose a convex optimization formulation with the Ky Fan $2$-$k$-norm and $\ell_1$-norm to find $k$ largest approximately rank-one submatrix blocks of a given nonnegative matrix that has low-rank block diagonal structure with noise. We analyze low-rank and sparsity structures of the optimal solutions using properties of these two matrix norms. We show that, under certain hypotheses, with high probability, the approach can recover rank-one submatrix blocks even when they are corrupted with random noise and inserted into a much larger matrix with other random noise blocks.

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

↑