mlsanityData to 14 Oct 2026

The Fast Convergence of Incremental PCA

arXiv 1501.03796 ↗First posted 15 Jan 2015cs.LG stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

We consider a situation in which we see samples in ℝ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.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Jan 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 5; 2022: 1; 2023: 2; 2024: 2; 2025: 3; 2026: 2.

15 papers.

Sort: