为在线PCA的特征向量元素提供快速不确定性估计
Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCA
- 基于奥卡算法,用伯恩斯坦不等式推导出元素误差上界
- 实现线性时间计算,误差率接近最优且可构建置信区间
- 适合需要实时分析的大数据流场景,计算效率远超传统方法
我们提出一种新颖的统计推断框架,用于基于奥卡算法的在线主成分分析(PCA),可对估计特征向量的单个元素构建置信区间。现有研究多关注sin²误差的紧致界,近期有工作涉及该误差的不确定性量化,但在线设置下对特征向量元素的不确定性量化仍基本未被探索。本文推导出估计向量元素的尖锐伯恩斯坦型浓度不等式,其误差率在对数因子内达到最优。同时建立了经适当中心化和缩放后部分元素的中心极限定理。为高效估计坐标方差,引入一个可证明一致的子采样算法,采用中位数-均值方法,实证性能与乘子自助法相当,但计算成本显著更低。数值实验表明,该方法能以极低计算开销提供可靠的不确定性估计。
原文摘要 · Abstract (English)
We propose a novel statistical inference framework for streaming principal component analysis (PCA) using Oja's algorithm, enabling the construction of confidence intervals for individual entries of the estimated eigenvector. Most existing works on streaming PCA focus on providing sharp sin-squared error guarantees. Recently, there has been some interest in uncertainty quantification for the sin-squared error. However, uncertainty quantification or sharp error guarantees for entries of the estimated eigenvector in the streaming setting remains largely unexplored. We derive a sharp Bernstein-type concentration bound for elements of the estimated vector matching the optimal error rate up to logarithmic factors. We also establish a Central Limit Theorem for a suitably centered and scaled subset of the entries. To efficiently estimate the coordinate-wise variance, we introduce a provably consistent subsampling algorithm that leverages the median-of-means approach, empirically achieving similar accuracy to multiplier bootstrap methods while being significantly more computationally efficient. Numerical experiments demonstrate its effectiveness in providing reliable uncertainty estimates with a fraction of the computational cost of existing methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。