arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.01986cs.DSmath.PR
收藏

低秩扰动下条件数的光滑分析

Smoothed analysis of the condition number under low-rank perturbations

Rikhav Shah, Sandeep Silwal

摘要:

令$M$是秩为$n-k$的任意$n$乘$n$矩阵。利用$k$随机高斯矩阵研究了$M$加一个\emph{low-rank}扰动$UV^T$的条件数,其中$U, V$是$n$.在一些必要的假设下,证明了$M+UV^T$不可能有大的条件数.这种扰动相对于充分研究的密集高斯扰动(其中每个条目被独立地扰动)的主要优点是存储$U,V$的$O(nk)$成本以及用于执行矩阵-向量乘法$(M+UV^T)x$的$O(nk)$时间复杂度的增加。这改善了密集扰动所需的$Ω(n^2)$空间和时间复杂度的增加,如果$M$最初是稀疏的,则这是特别繁重的。我们的研究结果还扩展到$U$和$V$的排名大于$k$和对称和复杂的设置的情况下。我们也给出了一个线性系统求解的应用程序,并进行了一些数值实验。最后,在平滑的分析框架中研究的其他问题中应用低秩噪声的障碍进行了讨论。

英文摘要:

Let $M$ be an arbitrary $n$ by $n$ matrix of rank $n-k$. We study the condition number of $M$ plus a \emph{low-rank} perturbation $UV^T$ where $U, V$ are $n$ by $k$ random Gaussian matrices. Under some necessary assumptions, it is shown that $M+UV^T$ is unlikely to have a large condition number. The main advantages of this kind of perturbation over the well-studied dense Gaussian perturbation, where every entry is independently perturbed, is the $O(nk)$ cost to store $U,V$ and the $O(nk)$ increase in time complexity for performing the matrix-vector multiplication $(M+UV^T)x$. This improves the $Ω(n^2)$ space and time complexity increase required by a dense perturbation, which is especially burdensome if $M$ is originally sparse. Our results also extend to the case where $U$ and $V$ have rank larger than $k$ and to symmetric and complex settings. We also give an application to linear systems solving and perform some numerical experiments. Lastly, barriers in applying low-rank noise to other problems studied in the smoothed analysis framework are discussed.

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

↑