资源分类
》 资源 》论文》Efficient Dimensionality Reduction for Canonical Correlation Analysis

Efficient Dimensionality Reduction for Canonical Correlation Analysis

2020-03-02 | |  58 |   39 |   0

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.

上一篇：Hierarchical Tensor Decomposition of Latent Tree Graphical Models

下一篇：Transition Matrix Estimation in High Dimensional Time Series

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...