Study shows how correlations between neural activity affect classification capacity.
problem Understanding how correlations between neural activity impact classification performance.
method Calculated the capacity of neural activity on spherical manifolds with and without correlations between centroids and axes.
result Introducing correlations between neural activity centroids pushes spheres closer together, while correlations between axes shrink their radii, revealing a duality between correlations and geometry in classification.
Canonical correlation analysis (CCA) is a popular technique for learning representations that are maximally correlated across multiple views in data. In this paper, we extend the CCA based framework for learning a multiview mixture model. We show that the proposed model and a set of simple heuristics yield improvements…
While the objective in traditional multi-armed bandit problems is to find the arm with the highest mean, in many settings, finding an arm that best captures information about other arms is of interest. This objective, however, requires learning the underlying correlation structure and not just the means of the arms. Se…
Paper proposes PSIPS for identifying Pareto set with correlated objectives.
problem Identifying the best answer among items with multiple conflicting metrics.
method Posterior sampling in stopping and sampling rules for structure and correlation.
result PSIPS is asymptotically optimal and demonstrates good empirical performance.
Mitigates spurious correlations without bias labels.
problem Spurious correlations bias model performance.
method Introduces a novel training objective and debiasing method DPR.
result DPR achieves state-of-the-art performance.
Similarity measure for Gaussian process predictive distributions.
problem Comparing predictive distributions of Gaussian processes for correlated functions.
method Developed a similarity metric to compare predictive distributions of Gaussian processes.
result Gaussian process predictive distributions can be compared and one is enough to model two correlated functions.
A new Adamize method improves multi-objective recommender systems.
problem Improving recommendation systems with multiple conflicting objectives.
method Developed a multi-objective model-agnostic Adamize method that corrects and stabilizes gradients.
result Significant improvements in recommendation systems, measured by hypervolume, coverage, and spacing.
New portfolio optimization method considers both asset-specific and systemic risks for financial networks.
problem Optimizing portfolios with both idiosyncratic and systemic risks in financial networks.
method Developed a multi-objective optimization model that incorporates idiosyncratic variance and network clustering coefficient.
result Optimal portfolios outperform in terms of return measures and have less drawdown compared to traditional strategies.
New method relaxes PCA orthogonality constraints using explained variance of correlated components.
problem Difficulty in using PCA for sparse design due to orthogonality constraints and non-differentiable penalty.
method Introduce expvar(Y) to measure variance explained by correlated components, relax orthogonality constraints.
result Two expvar(Y) definitions suitable for block PCA formulations without orthogonality constraints.
Correlation filters (CFs) are a class of classifiers that are attractive for object localization and tracking applications. Traditionally, CFs have been designed in the frequency domain using the discrete Fourier transform (DFT), where correlation is efficiently implemented. However, existing CF designs do not account …
Recommender systems need to mirror the complexity of the environment they are applied in. The more we know about what might benefit the user, the more objectives the recommender system has. In addition there may be multiple stakeholders - sellers, buyers, shareholders - in addition to legal and ethical constraints. Sim…
Method captures shared information across many views robustly.
problem Modeling hundreds of views per event and learning robust embeddings without view knowledge.
method View bootstrapping using multi-view correlation and matrix concentration theory.
result View bootstrapping captures shared information across many views robustly.
In our work, we propose a novel formulation for supervised dimensionality reduction based on a nonlinear dependency criterion called Statistical Distance Correlation, Szekely et. al. (2007). We propose an objective which is free of distributional assumptions on regression variables and regression model assumptions. Our…
Various convolutional neural networks (CNNs) were developed recently that achieved accuracy comparable with that of human beings in computer vision tasks such as image recognition, object detection and tracking, etc. Most of these networks, however, process one single frame of image at a time, and may not fully utilize…
In correlation clustering, we are given n objects together with a binary similarity score between each pair of them. The goal is to partition the objects into clusters so to minimise the disagreements with the scores. In this work we investigate correlation clustering as an active learning problem: each similarity sc…
One primary focus in multimodal feature extraction is to find the representations of individual modalities that are maximally correlated. As a well-known measure of dependence, the Hirschfeld-Gebelein-Rényi (HGR) maximal correlation becomes an appealing objective because of its operational meaning and desirable propert…
We describe a new optimization scheme for finding high-quality correlation clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our a…
GNP models predictive correlations and outperforms NPs.
problem Training and understanding of Neural Processes.
method Proposed a new model, Gaussian Neural Process (GNP), which incorporates translation equivariance and provides universal approximation guarantees.
result Demonstrates encouraging performance and provides universal approximation guarantees.
The diagonal effect of orders is well documented in different markets, which states that orders are more likely to be followed by orders of the same aggressiveness and implies the presence of short-term correlations in order flows. Based on the order flow data of 43 Chinese stocks, we investigate if there are long-rang…
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…
Bootstrapping regularizes singular correlation matrices, reducing the need for complex regularization.
problem Singular correlation matrices in large datasets.
method Averaging bootstrapped correlation matrices to ensure positive-definiteness.
result The averaged correlation matrix is almost surely positive-definite with a sufficient number of bootstraps.
This paper proposes a method to train multiple neural networks with shared parameters using a reconstruction loss.
problem Training multiple neural networks for correlated tasks separately is inefficient.
method Introduces a novel approach with a reconstruction loss to encourage shared features across multiple tasks.
result The proposed method achieves efficient transfer learning with competitive performance.
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…
Paper introduces a new cost function to improve deep learning model generalization.
problem Overfitting and poor extrapolation of deep learning models.
method Introduces a 'whitening' cost function based on the Ljung-Box statistic.
result Significant improvement in generalization for RNNs and image autoencoders.
We study the problem of forecasting volatility for the multifractal random walk model. In order to avoid the ill posed problem of estimating the correlation length T of the model, we introduce a limiting object defined in a quotient space; formally, this object is an infinite range logvolatility. For this object and th…
Unsupervised learning of disentangled representations involves uncovering of different factors of variations that contribute to the data generation process. Total correlation penalization has been a key component in recent methods towards disentanglement. However, Kullback-Leibler (KL) divergence-based total correlatio…
We propose a novel approach for sampling realistic financial correlation matrices. This approach is based on generative adversarial networks. Experiments demonstrate that generative adversarial networks are able to recover most of the known stylized facts about empirical correlation matrices estimated on asset returns.…
We introduce a method to learn a hierarchy of successively more abstract representations of complex data based on optimizing an information-theoretic objective. Intuitively, the optimization searches for a set of latent factors that best explain the correlations in the data as measured by multivariate mutual informatio…
We decompose the evidence lower bound to show the existence of a term measuring the total correlation between latent variables. We use this to motivate our β-TCVAE (Total Correlation Variational Autoencoder), a refinement of the state-of-the-art β-VAE objective for learning disentangled representations, requiring n…
New method disentangles latent subspaces under correlation shifts.
problem Correlations between factors of variation make disentanglement models less robust.
method Enforces independence between subspaces conditioned on available attributes using adversarial CMI minimization.
result Models are disentangled and robust under correlation shifts, including in weakly supervised settings.
Develops methods to learn correlation potentials for time-dependent Kohn-Sham systems.
problem Learning the correlation potential for time-dependent Kohn-Sham systems.
method Optimizing a least-squares objective subject to the TDKS equation using adjoints.
result Learned correlation potential models match ground truth electron densities and can have memory.
Collective classification has been intensively studied due to its impact in many important applications, such as web mining, bioinformatics and citation analysis. Collective classification approaches exploit the dependencies of a group of linked objects whose class labels are correlated and need to be predicted simulta…
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…
New method disentangles correlated factors without independence assumption.
problem Learning disentangled representations from correlated data.
method Hausdorff Factorized Support (HFS) criterion for disentanglement.
result HFS consistently improves disentanglement and recovery across various correlation settings.
DynMSA detects market clusters for better portfolio allocation.
problem Identifying stable market clusters for effective portfolio management.
method Combining Random Matrix Theory with modularity optimization and spectral clustering.
result DynMSA outperforms baseline models in intra- and inter-cluster correlation differences.
We introduce Block Sparse Canonical Correlation Analysis which estimates multiple pairs of canonical directions (together a "block") at once, resulting in significantly improved orthogonality of the sparse directions which, we demonstrate, translates to more interpretable solutions. Our approach builds on the sparse CC…
The statistical dependencies which independent component analysis (ICA) cannot remove often provide rich information beyond the linear independent components. It would thus be very useful to estimate the dependency structure from data. While such models have been proposed, they usually concentrated on higher-order corr…
CSTS benchmarks time series clustering by evaluating correlation structures.
problem Lack of validated ground truth for objectively assessing clustering quality.
method Synthetic benchmark CSTS for evaluating correlation structures in multivariate time series data.
result CSTS enables precise diagnosis of methodological limitations in correlation-based time series clustering.
The paper shows strong correlation between in-distribution and out-of-distribution performance in various machine learning models.
problem Understanding reliability of machine learning systems in unseen environments.
method Empirical analysis of various models and distribution shifts on CIFAR-10, ImageNet, and other datasets.
result Out-of-distribution performance is strongly correlated with in-distribution performance across different models and distribution shifts.
This study shows how trade policy uncertainty affects stock-T bill correlations.
problem The impact of trade policy uncertainty on stock-T bill relationships.
method Extended Dynamic Conditional Correlation (DCC) framework incorporating exogenous variables.
result Trade policy uncertainty significantly alters stock-T bill correlations, especially under specific political conditions.
We present a filter correlation based model compression approach for deep convolutional neural networks. Our approach iteratively identifies pairs of filters with the largest pairwise correlations and drops one of the filters from each such pair. However, instead of discarding one of the filters from each such pair naï…
Our goal in this paper is to develop an effective estimator of fractal dimension. We survey existing ideas in dimension estimation, with a focus on the currently popular method of Grassberger and Procaccia for the estimation of correlation dimension. There are two major difficulties in estimation based on this method. …
Canonical correlation analysis (CCA) is a fundamental statistical tool for exploring the correlation structure between two sets of random variables. In this paper, motivated by recent success of applying CCA to learn low dimensional representations of high dimensional objects, we propose to quantify the estimation loss…
Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.
problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.
A major challenge in reinforcement learning is exploration, when local dithering methods such as epsilon-greedy sampling are insufficient to solve a given task. Many recent methods have proposed to intrinsically motivate an agent to seek novel states, driving the agent to discover improved reward. However, while state-…
Study geodesics on flat tori, focusing on orthogonal lengths and their distribution.
problem Properties of geodesics on flat tori and their lengths.
method Fine study of dynamical correlation function and anisotropic Sobolev spaces.
result Properties of the length distribution and singularities of its Fourier transform.
Knowledge representation of graph-based systems is fundamental across many disciplines. To date, most existing methods for representation learning primarily focus on networks with simplex labels, yet real-world objects (nodes) are inherently complex in nature and often contain rich semantics or labels, e.g., a user may…
Algorithm learns stock correlation matrix embedding using graph machine learning.
problem Understanding complex relationships among stocks based on their correlation matrix.
method Proposes a graph machine learning approach called Node2Vec to compress the correlation network into an embedding.
result The algorithm can learn an embedding from the correlation network of S&P 500 stock data.