Sketching for principal component regression

Liron Mor-Yosef, Haim Avron

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


Principal component regression (PCR) is a useful method for regularizing least squares approximations. Although conceptually simple, straightforward implementations of PCR have high computational costs and so are inappropriate for large scale problems. In this paper, we propose efficient algorithms for computing approximate PCR solutions that, on one hand, are high quality approximations to the true PCR solutions (when viewed as minimizer of a constrained optimization problem) and, on the other hand, entertain rigorous risk bounds (when viewed as statistical estimators). In particular, we propose an input sparsity time algorithms for approximate PCR. We also consider computing an approximate PCR in the streaming model and kernel PCR. Empirical results demonstrate the excellent performance of our proposed methods.

Original languageEnglish
Pages (from-to)454-485
Number of pages32
JournalSIAM Journal on Matrix Analysis and Applications
Issue number2
StatePublished - 2019


FundersFunder number
International Business Machines Corporation
Israel Science Foundation1272/17


    • Compressed least squares
    • Least squares
    • Linear regression
    • Principal component regression
    • Randomized numerical linear algebra
    • Sketching


    Dive into the research topics of 'Sketching for principal component regression'. Together they form a unique fingerprint.

    Cite this