Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

336699132 · May 202619922001200920172026
48 results for canonical correlation

Canonical correlation analysis was proposed by Hotelling [6] and it measures linear relationship between two multidimensional variables. In high dimensional setting, the classical canonical correlation analysis breaks down. We propose a sparse canonical correlation analysis by adding l1 constraints on the canonical vec…

2017-05-30abs ↗pdf ↗

Canonical correlation analysis is a family of multivariate statistical methods for the analysis of paired sets of variables. Since its proposition, canonical correlation analysis has for instance been extended to extract relations between two sets of variables when the sample size is insufficient in relation to the dat…

2017-11-07abs ↗pdf ↗

Graph Canonical Correlation Analysis improves CCA for multiomics datasets.

problem Limited ability of conventional CCA methods to incorporate structured patterns in cross-correlation matrices.
method Graph Canonical Correlation Analysis (gCCA) calculates canonical correlations based on the graph structure of cross-correlation matrices.
result gCCA outperforms competing CCA methods in simulations and multiomics dataset analysis.

Proposes PSCCA for estimating correlations and canonical correlations in sparse count data.

problem Estimating correlations and canonical correlations in sparse count data from next-generation sequencing.
method Probabilistic approach for sparse count data sets (PSCCA).
result PSCCA outperforms other methods in estimating true correlations and canonical correlations at the natural parameter level.

A new method estimates conditional canonical correlations using random forests.

problem Estimating relationships between two sets of variables given covariates.
method Random Forest with Canonical Correlation Analysis (RFCCA)
result RFCCA provides accurate canonical correlation estimations and well-controlled Type-1 error.

For multiple multivariate data sets, we derive conditions under which Generalized Canonical Correlation Analysis (GCCA) improves classification performance of the projected datasets, compared to standard Canonical Correlation Analysis (CCA) using only two data sets. We illustrate our theoretical results with simulation…

2013-04-30abs ↗pdf ↗

We examine Deep Canonically Correlated LSTMs as a way to learn nonlinear transformations of variable length sequences and embed them into a correlated, fixed dimensional space. We use LSTMs to transform multi-view time-series data non-linearly while learning temporal relationships within the data. We then perform corre…

2018-01-16abs ↗pdf ↗

A new method scales CCA parameters by input to learn more correlated representations.

problem Limitation of conventional CCA models in learning highly correlated representations.
method Introduces a dynamic scaling method for training input-dependent canonical correlation models.
result Learned representations are more correlated and retrieval results are preferable.

New method for analyzing multiple longitudinal data processes.

problem Exploring associations between multiple random processes observed jointly.
method Functional Generalized Canonical Correlation Analysis (FGCCA) based on multiblock Regularized Generalized Canonical Correlation Analysis (RGCCA).
result FGCCA framework is robust to sparsely and irregularly observed data.

D2PCCA integrates deep learning and probabilistic modeling for nonlinear dynamical systems.

problem Analyzing nonlinear dynamical systems with probabilistic understanding.
method Combines deep learning and probabilistic modeling, using KL annealing and normalizing flows.
result Captures latent dynamics in sequential datasets with improved convergence and flexibility.

Two new methods for analyzing repeated measures data using embeddings into Reproducing Kernel Hilbert Spaces.

problem Analyzing complex data structures with multiple features over time.
method Two generalizations of canonical correlation analysis for repeated measures data using embeddings into Reproducing Kernel Hilbert Spaces.
result Consistency rates for transformation and correlation estimators, relaxing common assumptions.

Given two data matrices XX and YY, sparse canonical correlation analysis (SCCA) is to seek two sparse canonical vectors uu and vv to maximize the correlation between XuXu and YvYv. However, classical and sparse CCA models consider the contribution of all the samples of data matrices and thus cannot identify an unde…

2017-10-13abs ↗pdf ↗

Algorithm improves online canonical correlation analysis.

problem Online canonical correlation analysis.
method Stochastic Scaled-Gradient Descent (SSGD) for minimizing expectation over Riemannian manifolds.
result Achieved optimal one-time-scale algorithm with explicit rate of local asymptotic convergence.

Manifold matching works to identify embeddings of multiple disparate data spaces into the same low-dimensional space, where joint inference can be pursued. It is an enabling methodology for fusion and inference from multiple and massive disparate data sources. In this paper we focus on a method called Canonical Correla…

2012-09-17abs ↗pdf ↗

We introduce canonical correlation forests (CCFs), a new decision tree ensemble method for classification and regression. Individual canonical correlation trees are binary decision trees with hyperplane splits based on local canonical correlation coefficients calculated during training. Unlike axis-aligned alternatives…

2015-07-20abs ↗pdf ↗

A new model for multiview data analysis using graph autoencoders.

problem Nonlinear multiview canonical correlation analysis for large datasets.
method Variational approach with graph convolutional neural networks.
result Competitive performance on classification, clustering, and recommendation tasks.

We study the sample complexity of canonical correlation analysis (CCA), \ie, the number of samples needed to estimate the population canonical correlation and directions up to arbitrarily small error. With mild assumptions on the data distribution, we show that in order to achieve εε-suboptimality in a properly define…

2017-02-21abs ↗pdf ↗

In this paper, we formulate the Canonical Correlation Analysis (CCA) problem on matrix manifolds. This framework provides a natural way for dealing with matrix constraints and tools for building efficient algorithms even in an adaptive setting. Finally, an adaptive CCA algorithm is proposed and applied to a change dete…

2012-06-27abs ↗pdf ↗

DICCA maps multi-view data into a shared latent space with interpretable components.

problem Learning from multiple related but distinct data views.
method DICCA extends CCA to deep generative networks and uses sparsity-inducing priors for interpretability.
result DICCA effectively disentangles shared and view-specific variations in multi-view data.

We propose novel first-order stochastic approximation algorithms for canonical correlation analysis (CCA). Algorithms presented are instances of inexact matrix stochastic gradient (MSG) and inexact matrix exponentiated gradient (MEG), and achieve εε-suboptimality in the population objective in $\operatorname{poly}(\fr…

2017-02-22abs ↗pdf ↗

We present an extension of sparse Canonical Correlation Analysis (CCA) designed for finding multiple-to-multiple linear correlations within a single set of variables. Unlike CCA, which finds correlations between two sets of data where the rows are matched exactly but the columns represent separate sets of variables, th…

2015-11-19abs ↗pdf ↗

Canonical correlation analysis (CCA) has become a key tool for population neuroimaging, allowing investigation of associations between many imaging and non-imaging measurements. As other variables are often a source of variability not of direct interest, previous work has used CCA on residuals from a model that removes…

2020-02-24abs ↗pdf ↗

We simplify matrix computations for block matrices, especially useful for covariance and correlation matrices.

problem Complex computations for block matrices, especially for covariance and correlation matrices.
method Obtained a canonical representation for block matrices, facilitating computation of various matrix operations.
result Simplified computation of matrix operations for block matrices, particularly useful for covariance and correlation matrices.

Random features approach has been widely used for kernel approximation in large-scale machine learning. A number of recent studies have explored data-dependent sampling of features, modifying the stochastic oracle from which random features are sampled. While proposed techniques in this realm improve the approximation,…

2019-10-11abs ↗pdf ↗

Paper presents a new framework for optimal asset and signal combination.

problem Optimal asset and signal combination problem.
method Two-stage approach: reformulate dynamic portfolio selection problem, then use Canonical Correlation Analysis.
result Improved performance of proposed method over natural benchmarks.

Estimates linear model from noisy covariates and instruments using spectral regularization.

problem Estimating a linear model from many noisy covariates and instruments.
method Two-stage least squares with spectral regularization of canonical correlations.
result Upper and lower bounds on estimation error, proving optimality of the method with noisy data.

DTCCA learns nonlinear transformations of multi-view data for high-order correlation.

problem Learning complex nonlinear transformations of multiple data views.
method Maximizes high-order canonical correlation by jointly learning transformations of each view using a reformulated tensor decomposition.
result DTCCA efficiently handles high-dimensional and large number of views, overcoming scalability issues.

This paper offers a new algebraic perspective of GCCA using subspace intersection.

problem Finding common variables across multiple feature representations.
method Subspace intersection approach based on a (bi-)linear generative model.
result GCCA is equivalent to subspace intersection, with conditions for identifiable common subspace.

New method clusters evolving networks using spatio-temporal graph Laplacian.

problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.

Efficient algorithm for CCA on Riemannian manifolds with fast convergence.

problem Efficiently computing canonical correlation components on Riemannian manifolds.
method Reparametrization of projection matrices for stochastic optimization on Riemannian manifolds.
result Achieves $O( rac{1}{t})$ convergence rate for top kk components with O(d2k)O(d^2k) runtime complexity.

Biological neural network mimics CCA for multi-channel data.

problem Implementing CCA in a biologically plausible neural network.
method Derive an online CCA algorithm with local synaptic updates for multi-compartmental neurons.
result The derived neural network architecture and synaptic updates resemble cortical pyramidal neuron behavior.

We present a novel method for solving Canonical Correlation Analysis (CCA) in a sparse convex framework using a least squares approach. The presented method focuses on the scenario when one is interested in (or limited to) a primal representation for the first view while having a dual representation for the second view…

2009-08-19abs ↗pdf ↗