arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.00781cs.ITmath.ITmath.OC
收藏

矩阵不可除数列的尾不等式及其应用

Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications

Chao Zhang, Xianjie Gao, Min-Hsiu Hsieh, Hanyuan Hang, Dacheng Tao

摘要:

本文研究了无限可分矩阵最大特征值的尾不等式。级数,它是由i.d.加权的固定矩阵的有限和。随机变量我们得到了几类尾不等式,包括Bennett型和Bernstein型不等式.这允许我们进一步限制矩阵i.d.的谱范数的期望。系列.此外,通过对Bennett型不等式中的$Q(s)=(s+1)\log(s+1)-s$提出一个新的下界函数,我们得到了矩阵i.d.当矩阵维数较高时,比Bernstein型不等式更有意义。由此产生的下界函数是独立的利益,可以改善任何贝内特型浓度不等式,涉及的功能$Q(s)$。I. D的类概率分布很大,包括高斯分布和泊松分布等。因此,我们的结果包括现有的工作\cite{tropp2012user}矩阵高斯级数作为一种特殊情况。最后,我们证明了矩阵i.d.级数在许多优化问题中有应用,包括机会约束优化问题和正交约束的二次优化问题。此外,我们还使用由此产生的尾界表明,随机矩阵构造的独立同分布。随机变量作为压缩感知中的测量矩阵时,满足约束等距性(RIP)。

英文摘要:

In this paper, we study tail inequalities of the largest eigenvalue of a matrix infinitely divisible (i.d.) series, which is a finite sum of fixed matrices weighted by i.d. random variables. We obtain several types of tail inequalities, including Bennett-type and Bernstein-type inequalities. This allows us to further bound the expectation of the spectral norm of a matrix i.d. series. Moreover, by developing a new lower-bound function for $Q(s)=(s+1)\log(s+1)-s$ that appears in the Bennett-type inequality, we derive a tighter tail inequality of the largest eigenvalue of the matrix i.d. series than the Bernstein-type inequality when the matrix dimension is high. The resulting lower-bound function is of independent interest and can improve any Bennett-type concentration inequality that involves the function $Q(s)$. The class of i.d. probability distributions is large and includes Gaussian and Poisson distributions, among many others. Therefore, our results encompass the existing work \cite{tropp2012user} on matrix Gaussian series as a special case. Lastly, we show that the tail inequalities of a matrix i.d. series have applications in several optimization problems including the chance constrained optimization problem and the quadratic optimization problem with orthogonality constraints. In addition, we also use the resulting tail bounds to show that random matrices constructed from i.d. random variables satisfy the restricted isometry property (RIP) when it acts as a measurement matrix in compressed sensing.

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

↑