Publication
ICML 2013
Conference paper

Efficient dimensionality reduction for canonical correlation analysis

Abstract

We present a fast algorithm for approximate Canonical Correlation Analysis (CCA). Given a pair of tall-and-thin matrices, the proposed algorithm first employs a randomized dimensionality reduction transform to reduce the size of the input matrices, and then applies any standard CCA algorithm to the new pair of matrices. The algorithm computes an approximate CCA to the original pair of matrices with provable guarantees, while requiring asymptotically less operations than the state-of-the-art exact algorithms. Copyright 2013 by the author(s).

Date

Publication

ICML 2013

Authors

Topics

Share