Principal Component Projection Without Principal Component Analysis
Not on the map. Why?
Abstract (arXiv)
We show how to efficiently project a vector onto the top principal components of a matrix, without explicitly computing these components. Specifically, we introduce an iterative algorithm that provably computes the projection using few calls to any black-box routine for ridge regression. By avoiding explicit principal component analysis (PCA), our algorithm is the first with no runtime dependence on the number of top principal components. We show that it can be used to give a fast iterative method for the popular principal component regression problem, giving the first major runtime improvement over the naive method of combining PCA with regression. To achieve our results, we first observe that ridge regression can be used to obtain a "smooth projection" onto the top principal components. We then sharpen this approximation to true projection using a low-degree polynomial approximation to the matrix step function. Step function approximation is a topic of long-term interest in scientific computing. We extend prior theory by constructing polynomials with simple iterative structure and rigorously analyzing their behavior under limited precision.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Feb 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 0; 2024: 1; 2025: 1; 2026: 1.
6 papers.
- 2022A Sublinear Adversarial Training Algorithmcited by 22
- 2021Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphscited by 5
- 2024Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioningcited by 4
- 2025Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structurecited by 2
- 2026De-floored Principal Component Regression: When Rank Selection Alone Is Insufficient for Predictioncited by 1
- 2022Stochastic Parallelizable Eigengap Dilation for Large Graph Clusteringcited by 0
- 2026De-floored Principal Component Regression: When Rank Selection Alone Is Insufficient for Prediction18 Jul 2026
- 2025Approaching Optimality for Solving Dense Linear Systems with Low-Rank Structure15 Jul 2025
- 2024Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning9 May 2024
- 2022A Sublinear Adversarial Training Algorithm10 Aug 2022
- 2022Stochastic Parallelizable Eigengap Dilation for Large Graph Clustering29 Jul 2022
- 2021Minimax Optimal Regression over Sobolev Spaces via Laplacian Eigenmaps on Neighborhood Graphs14 Nov 2021