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,742 papers · 148 categories

Trend · papers per month

2356 · Jul 201919922001200920172026
48 results for multi-block CCA

New method finds linear relationships across multiple data blocks using proximal gradient descent with 1\ell_1 constraint.

problem Finding leading generalized eigenvectors for multi-block CCA.
method Proximal gradient descent with 1\ell_1 constraint.
result Rate-optimal solution under suitable assumptions.

Alternating Direction Method of Multipliers (ADMM) has become a widely used optimization method for convex problems, particularly in the context of data mining in which large optimization problems are often encountered. ADMM has several desirable properties, including the ability to decompose large problems into smalle…

2019-07-10abs ↗pdf ↗

Paper tackles multi-block min-max optimization with applications in deep AUC maximization.

problem Multi-block min-max bilevel optimization with non-convex strongly-concave upper level and strongly convex lower level.
method Single-loop randomized stochastic algorithm for constant number of blocks per iteration.
result Sample complexity of O(1/ε^4) for finding ε-stationary point, matching optimal complexity.

Canonical Correlation Analysis (CCA) is a widely used statistical tool with both well established theory and favorable performance for a wide range of machine learning problems. However, computing CCA for huge datasets can be very slow since it involves implementing QR decomposition or singular value decomposition of h…

2014-07-16abs ↗pdf ↗

Unified CCA methods for large-scale data with fast SGD algorithms.

problem Computational infeasibility of classical CCA methods for large-scale data.
method Unconstrained objective, stochastic gradient descent (SGD) algorithms.
result Significantly faster convergence and higher correlations than previous methods.

Canonical Correlation Analysis (CCA) is widely used for multimodal data analysis and, more recently, for discriminative tasks such as multi-view learning; however, it makes no use of class labels. Recent CCA methods have started to address this weakness but are limited in that they do not simultaneously optimize the CC…

2019-07-17abs ↗pdf ↗

Canonical Correlation Analysis (CCA) is a classical tool for finding correlations among the components of two random vectors. In recent years, CCA has been widely applied to the analysis of genomic data, where it is common for researchers to perform multiple assays on a single set of patient samples. Recent work has pr…

2012-06-18abs ↗pdf ↗

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 …

2015-11-16abs ↗pdf ↗

Canonical Correlation Analysis (CCA) is a classic technique for multi-view data analysis. To overcome the deficiency of linear correlation in practical multi-view learning tasks, various CCA variants were proposed to capture nonlinear dependency. However, it is non-trivial to have an in-principle understanding of these…

2019-07-04abs ↗pdf ↗

In the supervised high dimensional settings with a large number of variables and a low number of individuals, one objective is to select the relevant variables and thus to reduce the dimension. That subspace selection is often managed with supervised tools. However, some data can be missing, compromising the validity o…

2019-01-14abs ↗pdf ↗

Recent work has sought to understand the behavior of neural networks by comparing representations between layers and between different trained models. We examine methods for comparing neural network representations based on canonical correlation analysis (CCA). We show that CCA belongs to a family of statistics for mea…

2019-05-01abs ↗pdf ↗

Given two sets of variables, derived from a common set of samples, sparse Canonical Correlation Analysis (CCA) seeks linear combinations of a small number of variables in each set, such that the induced canonical variables are maximally correlated. Sparse CCA is NP-hard. We propose a novel combinatorial algorithm for s…

2016-05-29abs ↗pdf ↗

Paper proposes ASCCA for sparse CCA with trace Lasso regularization.

problem Sparse CCA in high-dimensional settings with correlated variables.
method Trace Lasso regularization, reformulated to Riemannian manifolds, inexact augmented Lagrangian method.
result Improved stability and interpretation of sparse CCA.

In this paper we propose a randomized primal-dual proximal block coordinate updating framework for a general multi-block convex optimization model with coupled objective function and linear constraints. Assuming mere convexity, we establish its O(1/t)O(1/t) convergence rate in terms of the objective value and feasibility m…

2016-05-19abs ↗pdf ↗

Sparse Canonical Correlation Analysis (CCA) has received considerable attention in high-dimensional data analysis to study the relationship between two sets of random variables. However, there has been remarkably little theoretical statistical foundation on sparse CCA in high-dimensional settings despite active methodo…

2013-11-24abs ↗pdf ↗

New algorithms tackle complex multi-block optimization problems in machine learning.

problem Non-convex multi-block bilevel optimization with hierarchical sampling challenges.
method Blockwise stochastic variance-reduced methods with parallel speedup.
result Achieves matching complexity to single-block problems with parallel speedup.

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.

Bayesian method improves sparse CCA for multi-view data.

problem Integrative statistical analysis of multi-view high-dimensional data.
method Bayesian infinite factor model with graphical horseshoe prior or diagonal structure to encourage sparsity.
result The proposed Bayesian ScSCCA approach achieves robust estimation of sparse CCA.

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.

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.

Canonical correlation analysis (CCA) is a powerful technique for discovering whether or not hidden sources are commonly present in two (or more) datasets. Its well-appreciated merits include dimensionality reduction, clustering, classification, feature selection, and data fusion. The standard CCA however, does not expl…

2018-03-27abs ↗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 ↗

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.

We study kk-GenEV, the problem of finding the top kk generalized eigenvectors, and kk-CCA, the problem of finding the top kk vectors in canonical-correlation analysis. We propose algorithms LazyEV\mathtt{LazyEV} and LazyCCA\mathtt{LazyCCA} to solve the two problems with running times linearly dependent on the input size and…

2016-07-20abs ↗pdf ↗