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

3775112149 · Jun 202019922001200920172026
48 results for correlation decomposition

The paper tackles fair correlation clustering with new algorithms and analysis.

problem Fair variants of correlation clustering under various constraints.
method Introducing a novel combinatorial optimization problem for fairlet decomposition.
result Approximation algorithms for fair correlation clustering under multiple fairness constraints.

Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.

problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.

New formulas for barrier options in stochastic volatility models with nonzero correlation.

problem Calculating barrier options prices in models with nonzero correlation.
method Derivation of two novel closed-form formulas: Hull and White type and Alòs-like decomposition.
result Closed-form formulas for barrier options in stochastic volatility models with nonzero correlation.

Portfolio allocation and risk management make use of correlation matrices and heavily rely on the choice of a proper correlation matrix to be used. In this regard, one important question is related to the choice of the proper sample period to be used to estimate a stable correlation matrix. This paper addresses this qu…

2019-11-14abs ↗pdf ↗

PFDL improves deep learning models' OOD generalization by decorrelating feature embeddings.

problem Out-of-distribution generalization in deep learning models.
method PFDL algorithm that optimizes feature decomposition network and image classification model.
result PFDL improves the accuracy of image classification models on OOD datasets.

Paper breaks down risk contribution into inherent and correlation risk components.

problem Understanding the sources of risk in portfolio contributions.
method Leave-one-out decomposition approach to separate inherent and correlation risk contributions.
result The decomposition reveals distinct contributions of position volatility and correlation to portfolio risk.

The paper proposes new cross-correlators using Price's Theorem and piecewise-linear decomposition.

problem Optimal method for estimating cross-correlations using finite samples.
method General mathematical framework using Price's Theorem and piecewise-linear decomposition.
result Some cross-correlators based on Huber's loss functions, MP functions, and LSE functions have higher SNR.

Two methods are proposed to filter correlations in DCC-GARCH residuals for foreign exchange rates.

problem Filtering correlations in DCC-GARCH residuals for accurate foreign exchange rate prediction.
method Two approaches: estimating correlation matrix as a parameter and using eigenvalue decomposition.
result The DCC-GARCH residual can be almost independent using these methods.

The study analyzes XRP transaction networks to understand market dynamics.

problem Understanding market dynamics of XRP through transaction data.
method Weekly weighted directed networks are embedded into a vector space using network embedding techniques. A correlation tensor is calculated and analyzed using singular value decomposition.
result The correlation tensor provides insights into the system's behavior and dependence on model parameters.

New method uses conformal prediction for time series forecasting, accounting for temporal correlation.

problem Uncertainty quantification in temporally correlated time series data.
method Time series decomposition with component-wise conformal prediction.
result The method provides customized prediction intervals for different temporal components.

A new method for traffic data imputation considering spatiotemporal correlations.

problem Traffic data imputation, especially for high-level missing scenarios.
method Spatiotemporal regularized Tucker decomposition approach.
result The proposed method outperforms existing methods on real-world traffic datasets.

PROD method improves high-dimensional regression by handling strong correlations.

problem Violation of Irrepresentable Condition in LASSO for high-dimensional data.
method PROD procedure based on orthogonal decomposition of design matrix.
result PROD enhances performance of high-dimensional penalized regression.

Develops methods to analyze feature-outcome associations in subpopulations.

problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.

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 ↗

Derives adjoint formulas for matrix operations and applies them to specific cases.

problem Computing adjoints for matrix operations and specific matrix types.
method Derives adjoint formulas for matrix operations and applies them to specific cases.
result Closed-form expressions for adjoints in specific matrix types.

GNCL algorithm controls diversity in deep ensembles.

problem Managing bias and variance in deep ensembles.
method Generalized bias-variance decomposition for arbitrary loss functions, leading to GNCL algorithm.
result Explicit control over ensemble diversity and smooth interpolation between independent and joint training.

DTCCA learns nonlinear transformations of multi-view data for high-order correlation.

problem Learning complex nonlinear transformations of multiple data views.
method Maximizes high-order canonical correlation by jointly learning transformations of each view using a reformulated tensor decomposition.
result DTCCA efficiently handles high-dimensional and large number of views, overcoming scalability issues.

D-GCCA improves multi-view data analysis by separating common and distinctive components.

problem Analyzing multi-view high-dimensional data with latent factors.
method Decomposes each view's data matrix into common and distinctive sources with orthogonality constraints.
result Consistent estimators with good performance and efficient computation.

We review the decomposition method of stock return cross-correlations, presented previously for studying the dependence of the correlation coefficient on the resolution of data (Epps effect). Through a toy model of random walk/Brownian motion and memoryless renewal process (i.e. Poisson point process) of observation ti…

2007-04-28abs ↗pdf ↗

Tensor decompositions are powerful tools for large data analytics as they jointly model multiple aspects of data into one framework and enable the discovery of the latent structures and higher-order correlations within the data. One of the most widely studied and used decompositions, especially in data mining and machi…

2018-07-03abs ↗pdf ↗

Develops tools to decompose spurious variations in causal models.

problem Understanding and decomposing spurious variations in causal relationships.
method Formal tools for decomposing spurious effects in Markovian and Semi-Markovian models.
result First results on non-parametric decomposition of spurious effects and sufficient conditions for identification.

In multi-label learning, each sample is associated with several labels. Existing works indicate that exploring correlations between labels improve the prediction performance. However, embedding the label correlations into the training process significantly increases the problem size. Moreover, the mapping of the label …

2011-03-01abs ↗pdf ↗

We propose a Standing Wave Decomposition (SWD) approximation to Gaussian Process regression (GP). GP involves a costly matrix inversion operation, which limits applicability to large data analysis. For an input space that can be approximated by a grid and when correlations among data are short-ranged, the kernel matrix…

2018-03-09abs ↗pdf ↗

Combining neural networks and multiscale decomposition for financial market analysis.

problem Financial markets' complexity and mainstream models' limitations in capturing non-linear structures.
method Neural networks for non-linear associations combined with multiscale decomposition.
result Improved understanding of financial market data substructures.

DEMOTE uses neural diffusion-reaction processes to capture temporal dynamics in sparse tensor data.

problem Sparse and temporally associated tensor data with limited structural knowledge.
method Develops a neural diffusion-reaction process to estimate dynamic embeddings for tensor modes.
result Captures both commonalities and personalities in evolving tensor entries.

The cohomology theory for financial market can allow us to deform Kolmogorov space of time series data over time period with the explicit definition of eight market states in grand unified theory. The anti-de Sitter space induced from a coupling behavior field among traders in case of a financial market crash acts like…

2016-06-09abs ↗pdf ↗

Word embedding is a powerful tool in natural language processing. In this paper we consider the problem of word embedding composition \--- given vector representations of two words, compute a vector for the entire phrase. We give a generative model that can capture specific syntactic relations between words. Under our …

2019-02-02abs ↗pdf ↗

New method uncovers hidden groups in CDS market not tied to standard industry classifications.

problem Identifying hidden groups in CDS market not tied to standard industry classifications.
method Data-driven approach using Random Matrix Theory to identify internally correlated and mutually anti-correlated communities.
result Introduces a novel default risk model that outperforms traditional alternatives.

Finite mixtures of regression models offer a flexible framework for investigating heterogeneity in data with functional dependencies. These models can be conveniently used for unsupervised learning on data with clear regression relationships. We extend such models by imposing an eigen-decomposition on the multivariate …

2013-12-02abs ↗pdf ↗

In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first establish that a class of special rank minimization problems has closed-form solutions. Using this result, we then propose penalty decomposition methods for general rank minimization pro…

2010-08-31abs ↗pdf ↗

The paper identifies universal features for high-dimensional data inference.

problem Identifying universal low-dimensional features from high-dimensional data for inference tasks.
method Introduces natural notions of universality and shows a local equivalence among them, using information geometry.
result Reveals the complementary roles of various data analysis techniques.

Paper proposes a new LSTM model for spatio-temporal learning.

problem Challenging video tasks require learning long-term spatio-temporal correlations.
method Introduces a higher-order convolutional LSTM model with tensor train decomposition.
result Model achieves state-of-the-art performance with significantly fewer parameters.