# Nonparametric Canonical Correlation Analysis

arXiv: https://arxiv.org/abs/1511.04839 · HTML: https://mlsanity.com/paper/1511.04839/

## Key facts

- Cited by 22 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 Nov 2015.

## Built on by (most cited first, 22 of 22)

- [Self-Supervised Speech Representation Learning: A Review](https://mlsanity.com/paper/2205.10643/) (2022)
- [Operator SVD with Neural Networks via Nested Low-Rank Approximation](https://mlsanity.com/paper/2402.03655/) (2024)
- [Spatiotemporal Analysis Using Riemannian Composition of Diffusion Operators](https://mlsanity.com/paper/2201.08530/) (2022)
- [Revisiting Deep Generalized Canonical Correlation Analysis](https://mlsanity.com/paper/2312.13455/) (2023)
- [How do kernel-based sensor fusion algorithms behave under high dimensional noise?](https://mlsanity.com/paper/2111.10940/) (2021)
- [Kernel spectral joint embeddings for high-dimensional noisy datasets using duo-landmark integral operators](https://mlsanity.com/paper/2405.12317/) (2024)
- [Discovery of Single Independent Latent Variable](https://mlsanity.com/paper/2110.05887/) (2021)
- [Maximally Machine-Learnable Portfolios](https://mlsanity.com/paper/2306.05568/) (2023)
- [Learning in Feature Spaces via Coupled Covariances: Asymmetric Kernel SVD and Nystr"om method](https://mlsanity.com/paper/2406.08748/) (2024)
- [Landmark Alternating Diffusion](https://mlsanity.com/paper/2404.19649/) (2024)
- [Self Supervised Correlation-based Permutations for Multi-View Clustering](https://mlsanity.com/paper/2402.16383/) (2024)
- [Provable Affine Identifiability of Nonlinear CCA under Latent Distributional Priors](https://mlsanity.com/paper/2510.04758/) (2025)
- [Unsupervised Synthetic Image Attribution: Alignment and Disentanglement](https://mlsanity.com/paper/2601.22663/) (2026)
- [Dynamically-Scaled Deep Canonical Correlation Analysis](https://mlsanity.com/paper/2203.12377/) (2022)
- [Conditional Deep Canonical Time Warping](https://mlsanity.com/paper/2412.18234/) (2024)
- [Multi-view mid fusion: a universal approach for learning in an HDLSS setting](https://mlsanity.com/paper/2507.06026/) (2025)
- [Spectral Ghost in Representation Learning: from Component Analysis to Self-Supervised Learning](https://mlsanity.com/paper/2601.20154/) (2026)
- [Generalized Robust Adaptive-Bandwidth Multi-View Manifold Learning in High Dimensions with Noise](https://mlsanity.com/paper/2602.10530/) (2026)
- [Complex Interpolation of Matrices with an application to Multi-Manifold Learning](https://mlsanity.com/paper/2604.14118/) (2026)
- [PEIRA: Learning Predictive Encoders through Inter-View Regressor Alignment](https://mlsanity.com/paper/2605.17671/) (2026)
- [Score the Algebra, Not the Span: Dimension Reduction for Transfer Operator Models of Dynamical Systems](https://mlsanity.com/paper/2608.18918/) (2026)
- [Which Tasks Survive Self-Supervised Learning?](https://mlsanity.com/paper/2609.38393/) (2026)

## Abstract (arXiv)

Canonical correlation analysis (CCA) is a classical representation learning technique for finding correlated variables in multi-view data. Several nonlinear extensions of the original linear CCA have been proposed, including kernel and deep neural network methods. These approaches seek maximally correlated projections among families of functions, which the user specifies (by choosing a kernel or neural network structure), and are computationally demanding. Interestingly, the theory of nonlinear CCA, without functional restrictions, had been studied in the population setting by Lancaster already in the 1950s, but these results have not inspired practical algorithms. We revisit Lancaster's theory to devise a practical algorithm for nonparametric CCA (NCCA). Specifically, we show that the solution can be expressed in terms of the singular value decomposition of a certain operator associated with the joint density of the views. Thus, by estimating the population density from data, NCCA reduces to solving an eigenvalue system, superficially like kernel CCA but, importantly, without requiring the inversion of any kernel matrix. We also derive a partially linear CCA (PLCCA) variant in which one of the views undergoes a linear projection while the other is nonparametric. Using a kernel density estimate based on a small number of nearest neighbors, our NCCA and PLCCA algorithms are memory-efficient, often run much faster, and perform better than kernel CCA and comparable to deep CCA.