返回
Randomized sketches for kernel CCA
DOI:10.1016/j.neunet.2020.04.006.png)
摘要
En 中文
Kernel canonical correlation analysis (KCCA) is a popular tool as a nonlinear extension of canonical correlation analysis. Consistency and optimal convergence rate have been established in the literature. However, the time complexity of KCCA scales as O(n(3)) and is thus prohibitive when n is large. We propose an m-dimensional randomized sketches approach for KCCA with m << n, based on the recent work on randomized sketches for kernel ridge regression (KRR). Technically we establish our theoretical results relying on an interesting connection between KCCA and KRR by utilizing a novel duality tracking device that alternates between the infinite-dimensional operator-theory-based view of KCCA and the finite-dimensional kernel-matrix-based view. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Canonical correlation analysis
Covariance/cross-covariance operator
Kernel method
Random projection
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.8K
被引数:
3.0W
机构
引用论文
RANDOMIZED SKETCHES FOR KERNELS: FAST AND OPTIMAL NONPARAMETRIC REGRESSION内核的随机草图: 快速和最佳的非参数回归
ANNALS OF STATISTICS
IF3.7
A new randomized Kaczmarz based kernel canonical correlation analysis algorithm with applications to information retrieval一种新的基于随机Kaczmarz的核典型相关分析算法及其在信息检索中的应用
NEURAL NETWORKS
IF6.3

