The Fast Convergence of Incremental PCA

01/15/2015
by   Akshay Balsubramani, et al.
0

We consider a situation in which we see samples in R^d drawn i.i.d. from some distribution with mean zero and unknown covariance A. We wish to compute the top eigenvector of A in an incremental fashion - with an algorithm that maintains an estimate of the top eigenvector in O(d) space, and incrementally adjusts the estimate with each new data point that arrives. Two classical such schemes are due to Krasulina (1969) and Oja (1983). We give finite-sample convergence rates for both.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset