随机矩阵的最优和算法范数正则化
Optimal and algorithmic norm regularization of random matrices
摘要:
令$A$是$n\times n$随机矩阵,其元素是i.i.d.。平均值$0$和方差$1$。我们提出了一个确定性的多项式时间算法,概率至少$1-2\exp(-Ω(εn))$在$A$的选择,找到一个$εn \times εn$子矩阵,使其归零的结果在$\widetilde{A}$与\[\|\widetilde{A}\| = O\left(\sqrt{n/ε}\right).\]我们的结果是最佳的一个常数因子,并提高了以前的结果Rebrova和Vershynin,和Rebrova。对于对称$n\times n$随机矩阵$A$,我们也证明了一个类似的结果.平均值$0$和方差$1$。
英文摘要:
Let $A$ be an $n\times n$ random matrix whose entries are i.i.d. with mean $0$ and variance $1$. We present a deterministic polynomial time algorithm which, with probability at least $1-2\exp(-Ω(εn))$ in the choice of $A$, finds an $εn \times εn$ sub-matrix such that zeroing it out results in $\widetilde{A}$ with \[\|\widetilde{A}\| = O\left(\sqrt{n/ε}\right).\] Our result is optimal up to a constant factor and improves previous results of Rebrova and Vershynin, and Rebrova. We also prove an analogous result for $A$ a symmetric $n\times n$ random matrix whose upper-diagonal entries are i.i.d. with mean $0$ and variance $1$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。