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

正则化低秩模型在并行结构中的应用

Adapting Regularized Low Rank Models for Parallel Architectures

Derek Driggs, Stephen Becker, Aleksandr Aravkin

摘要:

我们引入了正则化低秩恢复模型的重新表述,以利用GPU,多CPU和混合架构。低秩恢复通常涉及通过奇异值的迭代阈值化的核范数最小化。这些模型拟合缓慢,并且难以并行化,因为它们依赖于在每次迭代时计算奇异值分解。正则化的低秩恢复模型还包含非平滑项,以将结构化分量(例如稀疏离群值)与低秩分量分离,使这些问题更加困难。使用Burer-Monteiro分裂和边缘化,我们开发了一个光滑的,非凸的正则化低秩恢复模型,可以与一阶求解器。我们开发了一个可计算的证书,这个非凸的程序的收敛性,并使用它来建立任何点的次优性的界限。使用强大的主成分分析(RPCA)作为一个例子,我们包括数值实验表明,这种方法是一个数量级的速度比现有的RPCA求解器上的GPU。我们还表明,这种加速允许新的应用RPCA,包括实时背景减法和MR图像分析。

英文摘要:

We introduce a reformulation of regularized low-rank recovery models to take advantage of GPU, multiple CPU, and hybridized architectures. Low-rank recovery often involves nuclear-norm minimization through iterative thresholding of singular values. These models are slow to fit and difficult to parallelize because of their dependence on computing a singular value decomposition at each iteration. Regularized low-rank recovery models also incorporate non-smooth terms to separate structured components (e.g. sparse outliers) from the low-rank component, making these problems more difficult. Using Burer-Monteiro splitting and marginalization, we develop a smooth, non-convex formulation of regularized low-rank recovery models that can be fit with first-order solvers. We develop a computable certificate of convergence for this non-convex program, and use it to establish bounds on the suboptimality of any point. Using robust principal component analysis (RPCA) as an example, we include numerical experiments showing that this approach is an order-of-magnitude faster than existing RPCA solvers on the GPU. We also show that this acceleration allows new applications for RPCA, including real-time background subtraction and MR image analysis.

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

↑