Bootstrapping The Error Of Oja’S Algorithm
summary
Proves that n times the sin^2 error of Oja’s streaming PCA output follows a weighted χ2 approximation and gives conditions (eigengap, learning-rate regime with ηt≈η/n, η≈log n) under which the approximation holds; tools are Hoeffding/U‑statistic decompositions, high‑dimensional CLT for quadratic forms and matrix concentration; proposes an online multiplier bootstrap that keeps B Gaussian‑weighted Oja replicates updated using XT XT^T − X_{t−1}X_{t−1}^T scaled by 1/√2 and shows bootstrap consistency when there is variance decay (simulations match theory; flat spectra fail).
AI-written summary · about
chapters (16)
- 0:00Start
- 0:35Peter and Nancy
- 1:29Collaborators
- 1:59Outline
- 2:26PCA as an optimization problem
- 4:03A SGD type algorithm
- 7:28Prior work: Analysis of Oja's algorithm
- 11:11Building intuition with scalars
- 14:06The matrix case
- 15:22Sin squared error
- 18:15The main theorem
- 19:18Implications of Theorem 1
- 20:34An online bootstrap algorithm
- 24:31Final online bootstrap algorithm
- 25:30Result for bootstrap
- 26:14Some experiments
related talks
39mMemory Limited, Streaming PCA
34mError Estimation for Randomized Numerical Linear Algebra: Bootstrap Methods
31mRealizing Robustness
49mApproximate Message Passing Algorithms For Orthogonally Invariant Models
53mDesigning Robust Learners
01h 03mSampling for Linear Algebra, Statistics, and Optimization I
33mTradeoffs in Large Scale Learning: Statistical Accuracy vs. Numerical Precision
40mOptimally Weighted PCA for High-Dimensional Heteroscedastic Data
