arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0911.4108math.NAcs.NA
收藏

随机矩阵近似方案的误差界

Error Bounds for Random Matrix Approximation Schemes

Alex Gittens, Joel A. Tropp

AI总结:

本文针对随机矩阵稀疏化问题,在(∞,1)和(∞,2)范数下首次给出近似误差界,并利用Latala结果研究谱范数误差,证明了最优性,且对均匀有界条目给出了集中结果。

摘要:

随机矩阵稀疏化已被证明是一种富有成效的技术,可在从图划分到半定规划等应用中产生更快的算法。在近十年的研究中,除了少数例外,重点一直是在谱范数和Frobenius范数下确保近似质量。然而,对于某些图算法,$(\infty,1)$范数可能是更自然的性能度量。本文研究了用稀疏随机矩阵X在几种范数下逼近实矩阵A的问题。它首次给出了$(\infty,1)$和$(\infty,2)$范数下的近似误差结果,并利用Latala的结果研究了谱范数下的近似误差。这些界适用于确保X的条目独立且平均等于A对应条目的随机稀疏化方案。建立了$(\infty,1)$和$(\infty,2)$误差估计的最优性。当X的条目一致有界时,三个范数的集中结果成立。谱误差界用于预测文献中出现的几种稀疏化和量化方案的性能;结果与早期特定方案分析给出的性能保证具有竞争力。

英文摘要:

Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the focus has been--with few exceptions--on ensuring the quality of approximation in the spectral and Frobenius norms. For certain graph algorithms, however, the $(\infty,1)$ norm may be a more natural measure of performance. This paper addresses the problem of approximating a real matrix A by a sparse random matrix X with respect to several norms. It provides the first results on approximation error in the $(\infty, 1)$ and $(\infty, 2)$ norms, and it uses a result of Latala to study approximation error in the spectral norm. These bounds hold for random sparsification schemes which ensure that the entries of X are independent and average to the corresponding entries of A. Optimality of the $(\infty, 1)$ and $(\infty,2)$ error estimates is established. Concentration results for the three norms hold when the entries of X are uniformly bounded. The spectral error bound is used to predict the performance of several sparsification and quantization schemes that have appeared in the literature; the results are competitive with the performance guarantees given by earlier scheme-specific analyses.

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

↑