arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.12701stat.MLcs.LGmath.OC
收藏

稀疏加低秩矩阵分解:一种离散优化方法

Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach

Massachusetts Institute of Technology(麻省理工学院);Imperial College Business School(帝国理工学院商学院)

Dimitris Bertsimas, Ryan Cory-Wright, Nicholas A. G. Johnson

AI总结:

本文针对稀疏加低秩分解问题,提出离散优化新公式,并开发交替最小化启发式、半定松弛及分支定界算法,在秩、稀疏性和均方误差上优于现有方法,且可扩展至大规模实例。

摘要:

我们研究了稀疏加低秩分解问题(SLR),该问题旨在将一个被污染的数据矩阵分解为一个稀疏的扰动矩阵和一个包含真实信息的低秩矩阵。SLR是运筹学和机器学习中的一个基本问题,出现在各种应用中,包括数据压缩、潜在语义索引、协同过滤和医学成像。我们为SLR引入了一种新颖的公式化方法,直接对其潜在的离散性进行建模。针对这一公式,我们开发了一种交替最小化启发式算法,能够计算高质量的解,以及一种新颖的半定松弛方法,为我们的启发式算法返回的解提供有意义的界。我们还开发了一种定制的分支定界算法,利用我们的启发式算法和凸松弛方法,将小规模的SLR实例求解到可证明的(接近)最优。给定一个$n$乘$n$的输入矩阵,我们的启发式算法可扩展至在数分钟内求解$n=10000$的实例,我们的松弛方法可扩展至在数小时内求解$n=200$的实例,而我们的分支定界算法可扩展至在数分钟内求解$n=25$的实例。我们的数值结果表明,在秩、稀疏性和均方误差方面,我们的方法优于现有的最先进方法,同时保持了相当的计算时间。

英文摘要:

We study the Sparse Plus Low-Rank decomposition problem (SLR), which is the problem of decomposing a corrupted data matrix into a sparse matrix of perturbations plus a low-rank matrix containing the ground truth. SLR is a fundamental problem in Operations Research and Machine Learning which arises in various applications, including data compression, latent semantic indexing, collaborative filtering, and medical imaging. We introduce a novel formulation for SLR that directly models its underlying discreteness. For this formulation, we develop an alternating minimization heuristic that computes high-quality solutions and a novel semidefinite relaxation that provides meaningful bounds for the solutions returned by our heuristic. We also develop a custom branch-and-bound algorithm that leverages our heuristic and convex relaxations to solve small instances of SLR to certifiable (near) optimality. Given an input $n$-by-$n$ matrix, our heuristic scales to solve instances where $n=10000$ in minutes, our relaxation scales to instances where $n=200$ in hours, and our branch-and-bound algorithm scales to instances where $n=25$ in minutes. Our numerical results demonstrate that our approach outperforms existing state-of-the-art approaches in terms of rank, sparsity, and mean-square error while maintaining a comparable runtime.

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

↑