mlsanityData to 14 Oct 2026

Single-Pass PCA of Large High-Dimensional Data

arXiv 1704.07669 ↗First posted 25 Apr 2017cs.DS cs.LG cs.NAcited by 6

Not on the map. Why?

Abstract (arXiv)

Principal component analysis (PCA) is a fundamental dimension reduction tool in statistics and machine learning. For large and high-dimensional data, computing the PCA (i.e., the singular vectors corresponding to a number of dominant singular values of the data matrix) becomes a challenging task. In this work, a single-pass randomized algorithm is proposed to compute PCA with only one pass over the data. It is suitable for processing extremely large and high-dimensional data stored in slow memory (hard disk) or the data generated in a streaming fashion. Experiments with synthetic and real data validate the algorithm's accuracy, which has orders of magnitude smaller error than an existing single-pass algorithm. For a set of high-dimensional data stored as a 150 GB file, the proposed algorithm is able to compute the first 50 principal components in just 24 minutes on a typical 24-core computer, with less than 1 GB memory cost.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 25 Apr 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

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

6 papers.