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

255176101 · Jun 202019922001200920172026
48 results for Chatterjee correlation

Study shows conventional data prep fails for insurance data, proposing new methods.

problem Challenges in data preparation for insurance data lead to unreliable models.
method Proposes a new data preparation framework using support points and Chatterjee correlation coefficient.
result New methods significantly enhance model robustness and reduce computational resource requirements.

An introduction to the theory of bundle gerbes and their relationship to Hitchin-Chatterjee gerbes is presented. Topics covered are connective structures, triviality and stable isomorphism as well as examples and applications.

2007-12-11abs ↗pdf ↗

The purpose of this paper is to synthesize the approaches taken by Chatterjee-Meckes and Reinert-Röllin in adapting Stein's method of exchangeable pairs for multivariate normal approximation. The more general linear regression condition of Reinert-Röllin allows for wider applicability of the method, while the method of…

2009-02-02abs ↗pdf ↗

A dangerously brief history of the developments of the main ideas in economics, as observed by a physicist, is given. This was published in 'Econophysics of Stock and Other Markets', Eds. A. Chatterjee, B. K. Chakrabarti, New Economic Windows Series, Springer, Milan, 2006, pp~219-224.

2007-09-26abs ↗pdf ↗

We study the model of interacting agents proposed by Chatterjee et al that allows agents to both save and exchange wealth. Closed equations for the wealth distribution are developed using a mean field approximation. We show that when all agents have the same fixed savings propensity, subject to certain well defined app…

2004-07-29abs ↗pdf ↗

Continuous-time SGD converges under certain conditions, useful for deep learning.

problem Minimizing population expected loss in learning problems.
method Continuous-time approximation of stochastic gradient descent.
result Establishes sufficient conditions for convergence, applicable to overparametrized neural networks.

New computations for third and fourth cohomology of Lie group spaces.

problem Computing cohomology groups of homogeneous spaces of Lie groups.
method Explicit descriptions of third and fourth real de Rham cohomologies in terms of Lie-theoretic data.
result For a large class of homogeneous spaces, the difference between third and fourth Betti numbers equals the difference between the numbers of simple factors of the ambient group and the associated closed subgroup.

SGD converges with positive probability for non-convex deep neural networks under specific conditions.

problem Convergence of SGD for non-convex deep neural networks.
method Established local convergence with positive probability under local Łojasiewicz condition and additional structural assumption.
result SGD converges with positive probability for non-convex deep neural networks under specific conditions.

Study high-dimensional Bayesian linear regression using variational inference.

problem High-dimensional Bayesian linear regression with product priors.
method Non-linear large deviations theory and variational inference.
result Unique optimizer in variational problem governs posterior distribution under separation condition.

We construct a gerbe over a complex reductive Lie group G attached to an invariant bilinear form on a maximal diagonalizable subalgebra which is Weyl group invariant and satisfies a parity condition. By restriction to a maximal compact subgroup K, one then gets a gerbe over K. For a simply-connected group, the parity c…

2000-02-19abs ↗pdf ↗

The paper develops a cross-validation method for improving signal denoising techniques.

problem Improving signal denoising methods for nonparametric regression.
method Develops a general cross-validation framework for signal denoising and applies it to Trend Filtering and Dyadic CART.
result Cross validated versions of Trend Filtering and Dyadic CART achieve nearly optimal convergence rates.

The paper develops concentration inequalities for structured random data, extending beyond independent terms.

problem Developing concentration inequalities for structured weighted sums of random data, including tensors and matrix-valued data.
method The paper develops Hoeffding and Bernstein bounds for structured weighted sums under exchangeability, extending beyond the classical framework of independent terms.
result The paper develops a sharper concentration bound for combinatorial sums of matrix arrays.

Estimates inverse temperature of Ising models with a single sample.

problem Estimating inverse temperature in truncated Ising models with hard constraints.
method Maximizing pseudolikelihood to estimate the inverse temperature.
result An estimator that is nearly O(n)O(n) time and O(Δ3/n)O(Δ^3/\sqrt{n})-consistent.

New metric mm-coherence measures gradient alignment during training, revealing surprising memorization patterns.

problem Measuring and understanding the alignment of per-example gradients during training.
method Introducing mm-coherence as a metric to study gradient alignment, showing its advantages over existing metrics.
result Training with random labels leads to high mm-coherence, indicating common patterns even when generalization is not possible.

This work optimizes induced correlation in joint graph embeddings.

problem Optimizing correlation across embedded networks in joint graph embeddings.
method Developed corr2Omni algorithm to estimate optimal Omnibus weights.
result corr2Omni algorithm improves inference fidelity compared to classical Omnibus construction.

We analyze the daily stock data of the Nasdaq Composite index in the 22-year period 1992-2013 and identify market states as clusters of correlation matrices with similar correlation structures. We investigate the stability of the correlation structure of each state by estimating the statistical fluctuations of correlat…

2014-06-20abs ↗pdf ↗

The study uses DCC for financial market analysis, revealing hidden correlations.

problem Identifying hidden nonlinear correlations in financial markets.
method Agglomerative hierarchical clustering with distance correlation coefficient.
result DCC reveals more information than Pearson correlation for financial data.

This study uses local Gaussian correlation to analyze stock return tails, revealing more sensitive network properties.

problem Misleading results from Pearson correlation in financial networks.
method Local Gaussian correlation coefficient for capturing nonlinear dependence and heavy-tailed distributions.
result Local Gaussian correlation network among negative tails is more sensitive to stock market risks.

Polynomial time algorithm matches correlated Gaussian matrices without vanishing correlation.

problem Matching vertices in two correlated Erdős-Rényi graphs.
method Iterative matching algorithm for correlated Gaussian Wigner matrices.
result First polynomial time algorithm for graph matching with arbitrarily small constant correlation.

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 ↗

This paper introduces anti-correlation networks to study China's stock market.

problem Previous studies ignored anti-correlation in financial networks.
method Constructed weighted temporal anti-correlation and positive correlation networks.
result Unveiled differences in topological measurements between anti-correlation and positive correlation networks.

The study shows how trade uncertainty affects stock-bond correlations over time.

problem Impact of trade policy uncertainty on stock-bond correlations.
method Daily data analysis using GARCH-based models (CCC, STCC, DCC) with TPU and political dummy variables.
result Time-varying correlation models better capture the dynamics of stock-bond correlations than constant models.

Infinite CNNs lose spatial correlations, but can be restored by correlated weights.

problem Infinite CNNs lose spatial correlations, which are crucial for their performance.
method Introduced correlated weights to restore spatial correlations in infinite CNNs.
result Optimal performance is achieved with a moderate level of weight correlation.

We discuss some methods to quantitatively investigate the properties of correlation matrices. Correlation matrices play an important role in portfolio optimization and in several other quantitative descriptions of asset price dynamics in financial markets. Specifically, we discuss how to define and obtain hierarchical …

2008-09-26abs ↗pdf ↗

This research examines rare spurious correlations in neural networks and their impact on accuracy and privacy.

problem Rare spurious correlations in neural networks and their privacy risks.
method Introducing spurious patterns correlated with a fixed class to a few training examples, analyzing 2\ell_2 regularization and Gaussian noise.
result Rare spurious correlations can significantly impact neural network accuracy and privacy, and specific mitigation methods can be effective.

The study reveals how synaptic correlations promote dimension reduction in neural networks.

problem Understanding how synaptic correlations affect neural correlations and dimension reduction in deep neural networks.
method A simplified model of dimension reduction considering pairwise correlations among synapses, using mathematical self-consistency for both binary and continuous synapses.
result Weakly-correlated synapses encourage dimension reduction compared to orthogonal synapses, and they also slow down the decorrelation process.

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.

Polynomial-time algorithm matches correlated random graphs with non-vanishing correlation.

problem Matching correlated random graphs with non-vanishing edge correlation.
method Iterative algorithm for polynomial-time recovery of latent matching.
result Algorithm succeeds in recovering latent matching as long as edge correlation is non-vanishing.

Proposes a multi-view VAE for imputing missing data from correlated sources.

problem Imputing missing data from multi-view sources with latent space correlation.
method Enforces a joint prior with latent space correlation between VAEs trained on each view.
result More strongly correlated latent spaces are uncovered, enabling effective imputation.

Neurons in the visual cortex are correlated in their variability. The presence of correlation impacts cortical processing because noise cannot be averaged out over many neurons. In an effort to understand the functional purpose of correlated variability, we implement and evaluate correlated noise models in deep convolu…

2018-04-03abs ↗pdf ↗

Enhances community detection in correlated networks with node attributes.

problem Community detection in multiple networks with correlated node attributes and edges.
method Introduced the correlated Contextual Stochastic Block Model (CSBM), developed a two-step matching procedure.
result Algorithm recovers exact node correspondence, enabling enhanced community detection.

New method detects intrinsic cross-correlations in non-stationary time series affected by common factors.

problem Bias in cross-correlation analysis due to common external factors.
method Multifractal temporally weighted detrended partial cross-correlation analysis (MF-TWDPCCA).
result MF-TWDPCCA accurately detects intrinsic cross-correlations between non-stationary time series.

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.

The study finds significant power-law cross correlations in Bitcoin's return-volatility dynamics.

problem Investigating asymmetry in Bitcoin's return-volatility relationships.
method Analysis of daily and high-frequency Bitcoin data to identify cross correlations.
result Power-law cross correlations between returns and future volatilities are observed, indicating long-range dependencies.

We study power-law correlations properties of the Google search queries for Dow Jones Industrial Average (DJIA) component stocks. Examining the daily data of the searched terms with a combination of the rescaled range and rescaled variance tests together with the detrended fluctuation analysis, we show that the searche…

2015-02-01abs ↗pdf ↗

Discovering a correlation from one variable to another variable is of fundamental scientific and practical interest. While existing correlation measures are suitable for discovering average correlation, they fail to discover hidden or potential correlations. To bridge this gap, (i) we postulate a set of natural axioms …

2017-09-12abs ↗pdf ↗

This letter explores the behavior of conditional correlations among main cryptocurrencies, stock and bond indices, and gold, using a generalized DCC class model. From a portfolio management point of view, asset correlation is a key metric in order to construct efficient portfolios. We find that: (i) correlations among …

2018-11-20abs ↗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.

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 ↗