Bootstrapping the error of Oja's algorithm
Robert Lunde, Purnamrita Sarkar, Rachel Ward

TL;DR
This paper develops a bootstrap-based method to quantify the uncertainty in the estimation error of the leading eigenvector obtained via Oja's streaming PCA algorithm, combining advanced probabilistic tools.
Contribution
It introduces a weighted chi-squared approximation for the error and proposes an online multiplier bootstrap for uncertainty quantification in streaming PCA.
Findings
The bootstrap method provides consistent inference for the eigenvector error.
The approximation accurately captures the distribution of the estimation error.
Conditions for the bootstrap's validity are rigorously established.
Abstract
We consider the problem of quantifying uncertainty for the estimation error of the leading eigenvector from Oja's algorithm for streaming principal component analysis, where the data are generated IID from some unknown distribution. By combining classical tools from the U-statistics literature with recent results on high-dimensional central limit theorems for quadratic forms of random vectors and concentration of matrix products, we establish a weighted approximation result for the error between the population eigenvector and the output of Oja's algorithm. Since estimating the covariance matrix associated with the approximating distribution requires knowledge of unknown model parameters, we propose a multiplier bootstrap algorithm that may be updated in an online manner. We establish conditions under which the bootstrap distribution is close to the corresponding…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsRandom Matrices and Applications · Stochastic Gradient Optimization Techniques · Markov Chains and Monte Carlo Methods
