Low-Precision Streaming PCA
By: Sanjoy Dasgupta , Syamantak Kumar , Shourya Pandey and more
Potential Business Impact:
Makes computers learn faster with less memory.
Low-precision streaming PCA estimates the top principal component in a streaming setting under limited precision. We establish an information-theoretic lower bound on the quantization resolution required to achieve a target accuracy for the leading eigenvector. We study Oja's algorithm for streaming PCA under linear and nonlinear stochastic quantization. The quantized variants use unbiased stochastic quantization of the weight vector and the updates. Under mild moment and spectral-gap assumptions on the data distribution, we show that a batched version achieves the lower bound up to logarithmic factors under both schemes. This leads to a nearly dimension-free quantization error in the nonlinear quantization setting. Empirical evaluations on synthetic streams validate our theoretical findings and demonstrate that our low-precision methods closely track the performance of standard Oja's algorithm.
Similar Papers
Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCA
Statistics Theory
Helps computers guess how data changes over time.
Implicitly Normalized Online PCA: A Regularized Algorithm with Exact High-Dimensional Dynamics
Machine Learning (Stat)
Teaches computers to learn better from data.
Few-Round Distributed Principal Component Analysis: Closing the Statistical Efficiency Gap by Consensus
Methodology
Improves computer analysis of huge amounts of data.