无痛分解--低秩矩阵的有效分解
Painless Breakups -- Efficient Demixing of Low Rank Matrices
摘要:
假设我们给出了形式为$y = \sum_{k=1}^{s} \mathcal{A}_k ({X}_k)$的$s$不同秩的$r$矩阵的线性测量之和。何时以及在何种条件下可以从单个测量向量${y}$中提取(解混)各个矩阵${X}_k$?我们能有效地用数值方法进行分层吗?我们提出了两个计算效率高的算法的基础上硬阈值来解决这个低秩的分层问题。我们证明,在适当的条件下,这些算法是保证收敛到正确的解决方案,在一个线性的速度。我们将讨论与量子断层扫描和物联网相关的应用。数值模拟表明经验的性能所提出的算法。
英文摘要:
Assume we are given a sum of linear measurements of $s$ different rank-$r$ matrices of the form $y = \sum_{k=1}^{s} \mathcal{A}_k ({X}_k)$. When and under which conditions is it possible to extract (demix) the individual matrices ${X}_k$ from the single measurement vector ${y}$? And can we do the demixing numerically efficiently? We present two computationally efficient algorithms based on hard thresholding to solve this low rank demixing problem. We prove that under suitable conditions these algorithms are guaranteed to converge to the correct solution at a linear rate. We discuss applications in connection with quantum tomography and the Internet-of-Things. Numerical simulations demonstrate empirically the performance of the proposed algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。