On the Noise Sensitivity of the Randomized SVD

IF 2.9 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Information Theory Pub Date : 2024-08-26 DOI:10.1109/TIT.2024.3450412
Elad Romanov
{"title":"On the Noise Sensitivity of the Randomized SVD","authors":"Elad Romanov","doi":"10.1109/TIT.2024.3450412","DOIUrl":null,"url":null,"abstract":"The randomized singular value decomposition (R-SVD) is a popular sketching-based algorithm for efficiently computing the partial SVD of a large matrix. When the matrix is low-rank, the R-SVD produces its partial SVD exactly; but when the rank is large, it only yields an approximation. Motivated by applications in data science and principal component analysis (PCA), we analyze the R-SVD under a low-rank signal plus noise measurement model; specifically, when its input is a spiked random matrix. The singular values produced by the R-SVD are shown to exhibit a BBP-like phase transition: when the SNR exceeds a certain detectability threshold, that depends on the dimension reduction factor, the largest singular value is an outlier; below the threshold, no outlier emerges from the bulk of singular values. We further compute asymptotic formulas for the overlap between the ground truth signal singular vectors and the approximations produced by the R-SVD. Dimensionality reduction has the adverse affect of amplifying the noise in a highly nonlinear manner. Our results demonstrate the statistical advantage of the R-SVD—in both signal detection and estimation—over more naive sketched PCA variants; the advantage is especially dramatic when the sketching dimension is small. Our analysis is asymptotically exact, and substantially more fine-grained than existing operator-norm error bounds for the R-SVD, which largely fail to give meaningful error estimates in the moderate SNR regime. It applies for a broad family of sketching matrices previously considered in the literature, including Gaussian i.i.d. sketches, random projections, and the sub-sampled Hadamard transform, among others. Lastly, we derive optimal singular value shrinkers for singular values and vectors obtained through the R-SVD, designed optimally for both matrix denoising and covariance estimation. For the second task, the performance gains offered by the new shrinker may be particularly significant, especially so when the sketching dimension is small.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 5","pages":"3802-3834"},"PeriodicalIF":2.9000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10648976/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The randomized singular value decomposition (R-SVD) is a popular sketching-based algorithm for efficiently computing the partial SVD of a large matrix. When the matrix is low-rank, the R-SVD produces its partial SVD exactly; but when the rank is large, it only yields an approximation. Motivated by applications in data science and principal component analysis (PCA), we analyze the R-SVD under a low-rank signal plus noise measurement model; specifically, when its input is a spiked random matrix. The singular values produced by the R-SVD are shown to exhibit a BBP-like phase transition: when the SNR exceeds a certain detectability threshold, that depends on the dimension reduction factor, the largest singular value is an outlier; below the threshold, no outlier emerges from the bulk of singular values. We further compute asymptotic formulas for the overlap between the ground truth signal singular vectors and the approximations produced by the R-SVD. Dimensionality reduction has the adverse affect of amplifying the noise in a highly nonlinear manner. Our results demonstrate the statistical advantage of the R-SVD—in both signal detection and estimation—over more naive sketched PCA variants; the advantage is especially dramatic when the sketching dimension is small. Our analysis is asymptotically exact, and substantially more fine-grained than existing operator-norm error bounds for the R-SVD, which largely fail to give meaningful error estimates in the moderate SNR regime. It applies for a broad family of sketching matrices previously considered in the literature, including Gaussian i.i.d. sketches, random projections, and the sub-sampled Hadamard transform, among others. Lastly, we derive optimal singular value shrinkers for singular values and vectors obtained through the R-SVD, designed optimally for both matrix denoising and covariance estimation. For the second task, the performance gains offered by the new shrinker may be particularly significant, especially so when the sketching dimension is small.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于随机 SVD 的噪声敏感性
随机奇异值分解(R-SVD)是一种流行的基于草图的算法,用于有效地计算大矩阵的部分奇异值分解。当矩阵为低秩时,R-SVD精确地产生其部分SVD;但是当秩很大时,它只能得到一个近似值。基于数据科学和主成分分析(PCA)的应用,我们分析了低秩信号加噪声测量模型下的R-SVD;具体来说,当它的输入是一个尖刺随机矩阵时。由R-SVD产生的奇异值显示出类似bbp的相变:当信噪比超过一定的可检测阈值时,这取决于降维因子,最大的奇异值是一个异常值;在阈值以下,从大量奇异值中不会出现异常值。我们进一步计算了基真信号奇异向量与由R-SVD产生的近似之间重叠的渐近公式。降维具有以高度非线性的方式放大噪声的不利影响。我们的结果证明了r - svd在信号检测和估计方面的统计优势,超过了更幼稚的草图PCA变体;当草图尺寸较小时,其优势尤为明显。我们的分析是渐进精确的,并且比现有的R-SVD的算子范数误差范围更细粒度,后者在中等信噪比下很大程度上无法给出有意义的误差估计。它适用于以前在文献中考虑的广泛的素描矩阵,包括高斯i.i.d素描,随机投影和亚采样Hadamard变换等。最后,我们对通过R-SVD得到的奇异值和向量导出了最优奇异值收缩器,并对矩阵去噪和协方差估计进行了最优设计。对于第二个任务,新收缩器提供的性能增益可能特别显著,特别是当草图尺寸很小时。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
期刊最新文献
TechRxiv: Share Your Preprint Research with the World! IEEE Transactions on Information Theory Information for Authors On Differential and Boomerang Properties of a Class of Binomials Over Finite Fields of Odd Characteristic IEEE Transactions on Information Theory Information for Authors Multi-Task Semantic Communications With Bounded Privacy Leakage Constraint
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1