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

131262392523 · Jun 202019922001200920172026
48 results for correlation number

Develops correlation number for specific potentials and Hitchin representations.

problem Analyzing correlation numbers for potentials with entropy gaps and Hitchin representations.
method Defines a correlation number for pairs of cusped Hitchin representations and explores its connection to the Manhattan curve.
result Establishes a connection between the correlation number and the Manhattan curve, revealing rigidity properties.

This paper treats the problem of screening for variables with high correlations in high dimensional data in which there can be many fewer samples than variables. We focus on threshold-based correlation screening methods for three related applications: screening for variables with large correlations within a single trea…

2011-02-06abs ↗pdf ↗

Improved portfolio optimization using Kendall-like correlation coefficients.

problem Accurate estimation of eigenvectors in data-poor regimes for portfolio optimization.
method Developed generalized correlation coefficients based on Kendall's rank correlation.
result Markowitz portfolios with lower out-of-sample risk using these coefficients.

The paper studies the correlation of Hilbert lengths for convex projective surfaces.

problem Understanding the correlation of Hilbert lengths for convex projective surfaces.
method Asymptotic formula for free homotopy classes with renormalized Hilbert length.
result The correlation number is not uniformly bounded away from zero but can be larger than a uniform strictly positive constant.

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.

Method predicts which high-dimensional correlation signs will change in the future.

problem Predicting which correlation matrix coefficients will change signs in high-dimensional data.
method Stability of correlation signs depends on three-by-three relationships, inspired by Heider social cohesion theory.
result The method accurately predicts the stability of correlation signs in high-dimensional data.

We describe a method to determine the eigenvalue density of empirical covariance matrix in the presence of correlations between samples. This is a straightforward generalization of the method developed earlier by the authors for uncorrelated samples. The method allows for exact determination of the experimental spectru…

2005-08-19abs ↗pdf ↗

This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.

problem Recovering hidden vertex correspondences in partially correlated graphs.
method Proposed partially correlated Erdős-Rényi graphs model; information-theoretic thresholds; correlated functional digraphs.
result Optimal rates for partial and exact recovery of vertex correspondences.

A new method for Gaussian Processes handles mixed continuous and categorical inputs.

problem Modeling cross-correlations between continuous and categorical data.
method Low-Rank Correlation (LRC) method for Gaussian Processes with flexible rank approximation.
result LRC outperforms existing methods in estimating cross-correlations and predicting response surfaces.

We give a simple explicit formula for turnover reduction when a large number of alphas are traded on the same execution platform and trades are crossed internally. We model turnover reduction via alpha correlations. Then, for a large number of alphas, turnover reduction is related to the largest eigenvalue and the corr…

2014-04-20abs ↗pdf ↗

TCGPN improves stock forecasting by capturing temporal correlation patterns.

problem Stock forecasting with minimal periodicity and large node numbers.
method TCGPN uses Temporal-Correlation fusion encoder and pre-training methods to handle large datasets.
result TCGPN achieves state-of-the-art results on real stock market data.

The paper tackles fair correlation clustering with fairness constraints.

problem Minimizing disagreements while adhering to fairness constraints for clustering.
method Two variants of fairness constraints are considered: equal distribution and relative bounds. Approximation algorithms are developed for these constraints.
result Approximation algorithms for fair correlation clustering with theoretical guarantees and empirical validation.

Paper develops efficient algorithms for learning rationalizable equilibria in multiplayer games.

problem Learning rationalizable behavior in multiplayer games under bandit feedback.
method New algorithms for finding rationalizable Coarse Correlated Equilibria and Correlated Equilibria with polynomial sample complexity.
result Achieved polynomial sample complexity for learning rationalizable equilibria, improving over existing exponential complexity.

The paper reduces the complexity of financial market correlation matrices to a 2x2 matrix.

problem Reducing the complexity of financial market correlation matrices for easier analysis.
method Sectorial coarse graining followed by averaging over blocks of stocks.
result Averaging over blocks of stocks results in a reduced matrix with specific properties.

Sparse GCA finds linear relationships in multiple datasets, using gradient descent.

problem Finding linear relationships across multiple datasets with sparse loading vectors.
method Formulated as generalized eigenvalue problems, used a thresholded gradient descent algorithm.
result Proposed algorithm yields tight estimation error bounds and demonstrates effectiveness on synthetic datasets.

Recent advances in topic models have explored complicated structured distributions to represent topic correlation. For example, the pachinko allocation model (PAM) captures arbitrary, nested, and possibly sparse correlations between topics using a directed acyclic graph (DAG). While PAM provides more flexibility and gr…

2012-06-20abs ↗pdf ↗

Enhances multimodal generation with Normalizing Flows and correlation analysis.

problem Generating coherent cross-modal data from multiple sources.
method Uses Deep Canonical Correlation Analysis for shared information, Normalizing Flows for diversity, and Product of Experts for scalability.
result Improves likelihood, diversity, and coherence in conditional generation.

New hierarchical model improves on standard practice for high-dimensional data.

problem Poor statistical performance in high-dimensional hierarchical models.
method Model effects as exchangeable across covariates and correlated across datasets.
result Empirical Bayes estimator outperforms classic approach in high-dimensional settings.

In the presence of weak overall correlation, it may be useful to investigate if the correlation is significantly and substantially more pronounced over a subpopulation. Two different testing procedures are compared. Both are based on the rankings of the values of two variables from a data set with a large number n of o…

2015-04-21abs ↗pdf ↗

CaLoNet integrates spatial and local correlations for multivariate time series classification.

problem Ignoring spatial and local correlations in multivariate time series classification.
method Model spatial correlations using causality modeling, extract local correlations, integrate into graph neural network.
result Competitive performance compared to state-of-the-art methods on UEA datasets.

Correlations between asset returns are important in many financial applications. In recent years, multivariate volatility models have been used to describe the time-varying feature of the correlations. However, the curse of dimensionality quickly becomes an issue as the number of correlations is k(k1)/2k(k-1)/2 for kk asse…

2007-02-27abs ↗pdf ↗

In this paper, we apply tools from the random matrix theory (RMT) to estimates of correlations across volatility of various assets in the S&P 500. The volatility inputs are estimated by modeling price fluctuations as GARCH(1,1) process. The corresponding correlation matrix is constructed. It is found that the distribut…

2013-10-06abs ↗pdf ↗

The paper describes correlations of spectra for higher rank Anosov representations.

problem Understanding correlations of spectra for Anosov representations of higher rank groups.
method Relates correlation problem to counting projections in truncated hypertubes.
result Extends previous work on rank one representations to higher rank.

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 ↗

Study shows disentanglement models learn correlations from data, impacting fairness.

problem Disentanglement models learn correlations in real-world data, affecting downstream applications.
method Empirical study on 4260 models, analyzing correlations in latent representations.
result Systematically induced correlations are learned by disentanglement models, impacting fairness.

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 are often interested in explaining data through a set of hidden factors or features. When the number of hidden features is unknown, the Indian Buffet Process (IBP) is a nonparametric latent feature model that does not bound the number of active features in dataset. However, the IBP assumes that all latent features a…

2012-05-09abs ↗pdf ↗

Understanding and developing a correlation measure that can detect general dependencies is not only imperative to statistics and machine learning, but also crucial to general scientific discovery in the big data age. In this paper, we establish a new framework that generalizes distance correlation --- a correlation mea…

2017-10-26abs ↗pdf ↗

The paper introduces tests for high-dimensional independence using maximum and average distance correlations.

problem Testing independence in high-dimensional data.
method Characterizes consistency properties, compares test statistics, examines null distributions, and presents a fast chi-square-based procedure.
result The proposed tests are non-parametric and applicable to various metrics.

Neural networks learn faster with correlated latent variables.

problem Efficiently learning from higher-order correlations in neural networks.
method Analytical derivation and simulations of two-layer neural networks.
result Correlations between latent variables speed up learning from higher-order correlations.

The study analyzes the differences between physical and risk-neutral correlation estimates for equity baskets.

problem Analyzing the differences between physical and risk-neutral correlation estimates for equity baskets.
method Assumed equicorrelation, reduced dimensionality, approximated ICS from implied volatilities, analyzed dynamics using dynamic semiparametric factor model.
result Proposed profitability improvement schemes based on implied correlation forecasts.

We study a distributed estimation problem in which two remotely located parties, Alice and Bob, observe an unlimited number of i.i.d. samples corresponding to two different parts of a random vector. Alice can send kk bits on average to Bob, who in turn wants to estimate the cross-correlation matrix between the two par…

2018-05-31abs ↗pdf ↗

A new test statistic counts tree co-occurrences to detect edge correlation between networks.

problem Detecting edge correlation between networks using latent vertex correspondence.
method The test statistic is based on counting co-occurrences of signed trees for a family of non-isomorphic trees.
result The test runs in n2+o(1)n^{2+o(1)} time and succeeds with high probability for large nn.