秩约束软SVD算法的收敛性分析
Convergence Analysis of the Rank-Restricted Soft SVD Algorithm
摘要:
软奇异值分解是一种鲁棒的矩阵分解算法,也是矩阵完备化方法的关键组成部分。然而,由于大的存储器需求,使用用于SVD的常规数值方法来计算大型稀疏矩阵的软SVD通常是不切实际的。由Hastie等人引入的秩限制软SVD(RRSS)算法通过顺序计算容易适合内存的低秩SVD来解决这个问题。我们分析了标准RRSS算法的收敛性,并给出了标准算法不收敛的例子。我们表明,收敛需要修改的标准算法,并与非唯一性的SVD。我们的修改指定了一个一致的选择符号的左奇异向量的低秩SVD的迭代。在这些条件下,我们证明了线性收敛的奇异向量使用交替子空间迭代激发的技术。然后,我们推导出一个不动点迭代的奇异值的演变和显示线性收敛的软阈值的奇异值的原始矩阵。这最后一步需要一个扰动结果的不动点迭代,这可能是独立的利益。
英文摘要:
The soft SVD is a robust matrix decomposition algorithm and a key component of matrix completion methods. However, computing the soft SVD for large sparse matrices is often impractical using conventional numerical methods for the SVD due to large memory requirements. The Rank-Restricted Soft SVD (RRSS) algorithm introduced by Hastie et al. addressed this issue by sequentially computing low-rank SVDs that easily fit in memory. We analyze the convergence of the standard RRSS algorithm and we give examples where the standard algorithm does not converge. We show that convergence requires a modification of the standard algorithm, and is related to non-uniqueness of the SVD. Our modification specifies a consistent choice of sign for the left singular vectors of the low-rank SVDs in the iteration. Under these conditions, we prove linear convergence of the singular vectors using a technique motivated by alternating subspace iteration. We then derive a fixed point iteration for the evolution of the singular values and show linear convergence to the soft thresholded singular values of the original matrix. This last step requires a perturbation result for fixed point iterations which may be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。