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

218437655873 · Jun 202019922001200920172026
48 results for correlation optimization

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.

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.

Kernel methods linked to feature subspaces and maximal correlation kernels.

problem Understanding kernel methods and their relationship to feature extraction.
method Established a correspondence between feature subspaces and kernels, introduced maximal correlation kernels, and demonstrated their optimality.
result Kernel SVM on maximal correlation kernel achieves minimum prediction error.

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 formulate learning of a binary autoencoder as a biconvex optimization problem which learns from the pairwise correlations between encoded and decoded bits. Among all possible algorithms that use this information, ours finds the autoencoder that reconstructs its inputs with worst-case optimal loss. The optimal decode…

2016-11-07abs ↗pdf ↗

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 …

2014-11-10abs ↗pdf ↗

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…

2012-08-02abs ↗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.

The article proposes optimal learning strategies for machine learning-based reliability analysis.

problem Improving computational efficiency and accuracy in machine learning-based reliability analysis.
method Theorems and mathematical proofs for optimal learning strategies considering and neglecting correlations among design samples.
result The optimal learning strategy considering Kriging correlation outperforms other methods in terms of reduced evaluations of performance functions.

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 ↗

We consider a multi-armed bandit framework where the rewards obtained by pulling different arms are correlated. We develop a unified approach to leverage these reward correlations and present fundamental generalizations of classic bandit algorithms to the correlated setting. We present a unified proof technique to anal…

2019-11-06abs ↗pdf ↗

We consider the problem of portfolio optimization with a correlation constraint. The framework is the multiperiod stochastic financial market setting with one tradable stock, stochastic income and a non-tradable index. The correlation constraint is imposed on the portfolio and the non-tradable index at some benchmark t…

2019-12-28abs ↗pdf ↗

ARC algorithm optimizes dynamic pricing with correlated observations.

problem Optimizing dynamic pricing with correlated and generally distributed observations.
method Extends ARC algorithm to batched bandits with generalised linear model.
result ARC algorithm outperforms alternative approaches in dynamic pricing.

Paper presents a new framework for optimal asset and signal combination.

problem Optimal asset and signal combination problem.
method Two-stage approach: reformulate dynamic portfolio selection problem, then use Canonical Correlation Analysis.
result Improved performance of proposed method over natural benchmarks.

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 ↗

The properties of q-dependent cross-correlation matrices of stock market have been analyzed by using the random matrix theory and complex network. The correlation structures of the fluctuations at different magnitudes have unique properties. The cross-correlations among small fluctuations are much stronger than those a…

2017-04-13abs ↗pdf ↗

BDC uses Distance Correlation for efficient Bayesian optimization of expensive functions.

problem Efficiently optimizing expensive black-box functions with Bayesian methods.
method Integrates Bayesian optimization with Distance Correlation for automatic exploration and exploitation.
result BDC performs similarly to popular BO methods on benchmark tests and real terrain optimization.

This paper describes a new method of bond portfolio optimization based on stochastic string models of correlation structure in bond returns. The paper shows how to approximate correlation function of bond returns, compute the optimal portfolio allocation using Wiener-Hopf factorization, and check whether a collection o…

2002-08-17abs ↗pdf ↗

In this paper, we use replica analysis to investigate the influence of correlation among the return rates of assets on the solution of the portfolio optimization problem. We consider the behavior of the optimal solution for the case where the return rate is described with a single-factor model and compare the findings …

2017-04-05abs ↗pdf ↗

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.

New method improves multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.

problem Existing multi-fidelity Bayesian optimization methods assume global correlation and constant noise, which limits performance.
method Proposes an MF emulation method that learns noise models for each data source and leverages locally correlated LF sources.
result Improves performance of multi-fidelity Bayesian optimization by accounting for local correlations and varying noise.

We propose improved methods to identify stock groups using the correlation matrix of stock price changes. By filtering out the marketwide effect and the random noise, we construct the correlation matrix of stock groups in which nontrivial high correlations between stocks are found. Using the filtered correlation matrix…

2005-03-09abs ↗pdf ↗

New algorithm reduces variance in Monte Carlo simulations using deep neural networks and policy gradients.

problem Reducing variance in Monte Carlo simulations for estimating function values.
method Optimal correlation search using deep neural networks and policy gradients.
result Optimal correlation function reduces variance by approximating and calibrating policy.

Complex network analysis reveals dominant stocks in financial stock returns correlations.

problem Inferring financial stock returns correlations from complex network analysis.
method Simulated geometric Brownian motion for stocks, complex network analysis, eigenvector centrality, clustering.
result Returns correlation matrix is dominated by stocks with high eigenvector centrality and clustering.

Using Random Matrix Theory one can derive exact relations between the eigenvalue spectrum of the covariance matrix and the eigenvalue spectrum of its estimator (experimentally measured correlation matrix). These relations will be used to analyze a particular case of the correlations in financial series and to show that…

2003-12-18abs ↗pdf ↗

Two insurance companies collaborate to maximize the probability of none going bankrupt.

problem Maximizing the probability of no company bankruptcy in a correlated Brownian motion model.
method Analyzing optimal strategies and deriving explicit formulas for minimal ruin probability.
result Maximizing collaboration benefits when Brownian motions are positively correlated.

Although the Lasso has been extensively studied, the relationship between its prediction performance and the correlations of the covariates is not fully understood. In this paper, we give new insights into this relationship in the context of multiple linear regression. We show, in particular, that the incorporation of …

2014-02-07abs ↗pdf ↗

This study examines memory effects in S&P500 market correlations using Langevin models.

problem The neglect of memory effects in market correlations for optimal portfolio selection.
method Fit a generalised Langevin equation (GLE) to S&P500 market correlation data.
result Memory effects in market correlations significantly improve forecasting accuracy and suggest a hidden slow time scale.

We consider a portfolio allocation problem for trend following (TF) strategies on multiple correlated assets. Under simplifying assumptions of a Gaussian market and linear TF strategies, we derive analytical formulas for the mean and variance of the portfolio return. We construct then the optimal portfolio that maximiz…

2014-10-30abs ↗pdf ↗

We consider insurance derivatives depending on an external physical risk process, for example a temperature in a low dimensional climate model. We assume that this process is correlated with a tradable financial asset. We derive optimal strategies for exponential utility from terminal wealth, determine the indifference…

2007-05-25abs ↗pdf ↗

New bounds for KANs trained with DP-SGD, addressing correlated noise.

problem Risk bounds for Kolmogorov-Arnold Networks trained by DP-SGD with correlated noise.
method Established new optimization and population risk analysis for KANs trained with DP-SGD, addressing correlated noise.
result First optimization and population risk analysis of correlated-noise mechanisms for DP training in non-convex settings, including neural networks.

CAKD framework optimizes knowledge transfer by focusing on influential components of distillation.

problem Balancing and optimizing knowledge transfer in distillation models.
method Decouple KL divergence into BCD, SCD, and WCD; prioritize influential components.
result CAKD framework consistently outperforms baseline across diverse models and datasets.

The paper optimizes portfolios in a financial market with correlated assets using a stochastic volatility model.

problem Optimizing portfolios in a financial market with correlated assets and stochastic volatility.
method Derive a Hamilton-Jacobi-Bellman equation, use approximation methods, analyze value function using expansion of utility function, control error with second-order terms, generate close-to-optimal portfolio.
result Close-to-optimal portfolio generated using first-order approximation of utility function with controlled error.

In this work, we consider the optimal portfolio selection problem under hard constraints on trading amounts, transaction costs and different rates for borrowing and lending when the risky asset returns are serially correlated. No assumptions about the correlation structure between different time points or about the dis…

2014-10-29abs ↗pdf ↗

Variational Auto-Encoders (VAEs) are capable of learning latent representations for high dimensional data. However, due to the i.i.d. assumption, VAEs only optimize the singleton variational distributions and fail to account for the correlations between data points, which might be crucial for learning latent representa…

2019-05-14abs ↗pdf ↗

Optimizes dynamic investment portfolios with correlated jumps.

problem Maximizing expected terminal wealth in a multivariate Merton model with dependent jumps.
method Approximating CVaR with comonotonic bounds and maximizing expected terminal wealth.
result Improved optimization of dynamic investment portfolios.