Method estimates sparse inverse covariance and partial correlation matrices efficiently.
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.
Trend · papers per month
New method learns frequency-dependent partial correlations.
This paper sets thresholds for recovering vertex correspondences in partially correlated graphs.
We perform a comparative analysis of the Chinese stock market around the occurrence of the 2008 crisis based on the random matrix analysis of high-frequency stock returns of 1228 stocks listed on the Shanghai and Shenzhen stock exchanges. Both raw correlation matrix and partial correlation matrix with respect to the ma…
In this paper, we propose a mixture of probabilistic partial canonical correlation analysis (MPPCCA) that extracts the Causal Patterns from two multivariate time series. Causal patterns refer to the signal patterns within interactions of two elements having multiple types of mutually causal relationships, rather than a…
New method detects intrinsic cross-correlations in non-stationary time series affected by common factors.
The econophysics approach to socio-economic systems is based on the assumption of their complexity. Such assumption inevitably lead to another assumption, namely that underlying interconnections within socio-economic systems, particularly financial markets, are nonlinear, which is shown to be true even in mainstream ec…
A new screening method for high-dimensional data reduces computational cost.
Blind source separation (BSS) is a very popular technique to analyze multichannel data. In this context, the data are modeled as the linear combination of sources to be retrieved. For that purpose, standard BSS methods all rely on some discrimination principle, whether it is statistical independence or morphological di…
Researchers prove it's impossible to partially recover graph alignments in certain conditions.
Partial recovery of node mappings between correlated graphs is possible under specific conditions.
PFDL improves deep learning models' OOD generalization by decorrelating feature embeddings.
When common factors strongly influence two power-law cross-correlated time series recorded in complex natural or social systems, using classic detrended cross-correlation analysis (DCCA) without considering these common factors will bias the results. We use detrended partial cross-correlation analysis (DPXA) to uncover…
We study the problem of recovering the structure underlying large Gaussian graphical models or, more generally, partial correlation graphs. In high-dimensional problems it is often too costly to store the entire sample covariance matrix. We propose a new input model in which one can query single entries of the covarian…
Study reveals limits of PLS in multi-modal learning with correlated signals.
Paper tackles group robustness with partially labeled data.
The value of an asset in a financial market is given in terms of another asset known as numeraire. The dynamics of the value is non-stationary and hence, to quantify the relationships between different assets, one requires convenient measures such as the means and covariances of the respective log returns. Here, we dev…
In this work, we propose a simple yet effective solution to the problem of connectome inference in calcium imaging data. The proposed algorithm consists of two steps. First, processing the raw signals to detect neural peak activities. Second, inferring the degree of association between neurons from partial correlation …
Graphical estimation of count time series dependencies.
Detecting correlated trees helps align sparse graphs.
While sparse inverse covariance matrices are very popular for modeling network connectivity, the value of the dense solution is often overlooked. In fact the L2-regularized solution has deep connections to a number of important applications to spectral graph theory, dimensionality reduction, and uncertainty quantificat…
Variable clustering is important for explanatory analysis. However, only few dedicated methods for variable clustering with the Gaussian graphical model have been proposed. Even more severe, small insignificant partial correlations due to noise can dramatically change the clustering result when evaluating for example w…
Model rough volatility using RDEs with correlated Brownian motion and fractional Brownian motion.
This paper detects Markov violations in RL with noise, improving policy development.
Variable selection plays an important role in the high-dimensional data analysis. However the high-dimensional data often induces the strongly correlated variables problem. In this paper, we propose Elastic Net procedure for partially linear models and prove the group effect of its estimate. By a simulation study, we s…
New algorithm for partially observable contexts in finance.
Improved CI test for heteroskedastic data enhances causal discovery.
Recurrent networks learn beliefs from history in partially observable environments.
We consider the problem of providing nonparametric confidence guarantees for undirected graphs under weak assumptions. In particular, we do not assume sparsity, incoherence or Normality. We allow the dimension to increase with the sample size . First, we prove lower bounds that show that if we want accurate infe…
We introduce a new test for detection of power-law cross-correlations among a pair of time series - the rescaled covariance test. The test is based on a power-law divergence of the covariance of the partial sums of the long-range cross-correlated processes. Utilizing a heteroskedasticity and auto-correlation robust est…
PPM improves graph matching for correlated Gaussian Wigner models with high probability.
Estimates complex dependency structures in multi-omics data.
Survey of methods to recover CI graphs from feature relationships.
This paper tackles sample-efficient reinforcement learning for partially observable Markov games.
We describe various sets of conditional independence relationships, sufficient for qualitatively comparing non-vanishing squared partial correlations of a Gaussian random vector. These sufficient conditions are satisfied by several graphical Markov models. Rules for comparing degree of association among the vertices of…
Optimal algorithms learn Gaussian trees and polytrees from data.
The presence of significant cross-correlations between the synchronous time evolution of a pair of equity returns is a well-known empirical fact. The Pearson correlation is commonly used to indicate the level of similarity in the price changes for a given pair of stocks, but it does not measure whether other stocks inf…
The paper derives market-based correlations between asset prices and returns.
Study on cryptocurrency trading patterns using multifractal analysis.
Network analysis improves stock return forecasting.
Neighborhood regression has been a successful approach in graphical and structural equation modeling, with applications to learning undirected and directed graphical models. We extend these ideas by defining and studying an algebraic structure called the neighborhood lattice based on a generalized notion of neighborhoo…
Optimizes high-dimensional portfolios using joint shrinkage.
We propose a discrete time algorithm for the valuation of employee stock options based on exponential indifference prices and taking into account both the possibility of partial exercise of a fraction of the options and the use of a correlated traded asset to hedge part of their risk. We determine the optimal exercise …
This paper develops a method to derive optimal portfolios and risk premia explicitly in a general diffusion model for an investor with power utility and a long horizon. The market has several risky assets and is potentially incomplete. Investment opportunities are driven by, and partially correlated with, state variabl…
Correlation matrices are omnipresent in multivariate data analysis. When the number d of variables is large, the sample estimates of correlation matrices are typically noisy and conceal underlying dependence patterns. We consider the case when the variables can be grouped into K clusters with exchangeable dependence; t…
Many real world network problems often concern multivariate nodal attributes such as image, textual, and multi-view feature vectors on nodes, rather than simple univariate nodal attributes. The existing graph estimation methods built on Gaussian graphical models and covariance selection algorithms can not handle such d…
Paper studies vertex correspondence recovery in correlated graphs with node features.
Correlations and other collective phenomena in a schematic model of heterogeneous binary agents (individual spin-glass samples) are considered on the complete graph and also on 2d and 3d regular lattices. The system's stochastic dynamics is studied by numerical simulations. The dynamics is so slow that one can meaningf…