We investigate the daily correlation present among market indices of stock exchanges located all over the world in the time period Jan 1996 - Jul 2009. We discover that the correlation among market indices presents both a fast and a slow dynamics. The slow dynamics reflects the development and consolidation of globaliz…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “fast correlation”
We investigate the dynamics of correlations present between pairs of industry indices of US stocks traded in US markets by studying correlation based networks and spectral properties of the correlation matrix. The study is performed by using 49 industry index time series computed by K. French and E. Fama during the tim…
A new estimator for asynchronous tick data shows better correlation estimates.
problem Estimating correlation from asynchronous tick data.
method Derive a minimum-variance estimator and a fast linear-time estimator.
result The fast tickwise estimator has smaller estimation errors than the usual method.
Fast feature selection for SHM using canonical correlation.
problem Feature selection for structural health monitoring.
method Greedy search of sum of squared canonical correlation coefficients.
result Extremely fast feature selection with good performance.
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…
New Hermite series estimator for Spearman rank correlation in non-stationary data.
problem Estimating time-varying Spearman rank correlation efficiently.
method Hermite series based sequential estimator for both stationary and non-stationary settings.
result Competitive performance compared to existing algorithms in simulations and real data.
The performance of sparse signal recovery from noise corrupted, underdetermined measurements can be improved if both sparsity and correlation structure of signals are exploited. One typical correlation structure is the intra-block correlation in block sparse signals. To exploit this structure, a framework, called block…
Paper presents a fast algorithm for pricing Bermudan swaptions under the two-factor Hull-White model.
problem Evaluating Bermudan swaption prices under the two-factor Hull-White model with high computational efficiency.
method Discretization of expected value calculation, Gaussian kernel sums, fast Gauss transform, grid rotation for stability.
result Significant reduction in computation time and improved stability for correlation close to -1.
Enhances hashing for fast retrieval with correlated bits.
problem Fast retrieval and small memory footprint for large-scale information retrieval.
method Employing Boltzmann machine distribution as variational posterior to model correlations among hash code bits.
result Significant performance gains achieved by effectively modeling correlations among hash code bits.
Fast classification for sparse models, even with correlated features.
problem Sparse classification with many correlated features.
method Linear and quadratic surrogate cuts, priority queue, and analytical solution for exponential loss.
result 2 to 5 times faster than previous approaches, interpretable models with comparable accuracy.
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…
A fast method estimates correlations in hybrid systems using observable market data.
problem Estimating instantaneous correlations in hybrid systems from observable data.
method Empirical correlations between observable market quantities are used to estimate state variables' correlations. Linear systems are involved, and the matrix is converted to positive semidefinite if necessary.
result The estimates are reasonably accurate, especially with more than 1,000 data points.
Improved CEM for fast real-time planning in high-dimensional control tasks.
problem Sampling inefficiency of CEM in real-time planning.
method Novel additions to CEM including temporally-correlated actions and memory.
result 2.7-22x less samples and 1.2-10x performance increase.
This paper speeds up Gaussian process regression for autocorrelated data.
problem Temporal overfitting in Gaussian process models for autocorrelated data.
method Modifying existing Gaussian process approximations to handle blocked, de-correlated data.
result Proposed methods accelerate Gaussian process regression on autocorrelated data without sacrificing performance.
This paper presents Correlated Nystrom Views (XNV), a fast semi-supervised algorithm for regression and classification. The algorithm draws on two main ideas. First, it generates two views consisting of computationally inexpensive random features. Second, XNV applies multiview regression using Canonical Correlation Ana…
Analytical pricing formulas and Greeks are obtained for European and American basket put options using Mellin transforms. We assume assets are driven by geometric Brownian motion which exhibit correlation and pay a continuous dividend rate. A novel approach to numerical Mellin inversion is achieved via the fast Fourier…
Semi-analytic approximate stability selection for correlated data in generalized linear modelsstat.ML
A fast, approximate method for variable selection in GLMs tackles correlated data.
problem Variable selection in generalized linear models with correlated data.
method Replica method of statistical mechanics and vector approximate message passing.
result The proposed algorithm provides fast convergence and high approximation accuracy.
A fast feature selection method using OLS and SOCC for classification.
problem Feature selection for linear classification.
method Orthogonal Least Squares (OLS) with Squared Orthogonal Correlation Coefficient (SOCC).
result The proposed method outperforms other feature selection methods in speed and accuracy.
New algorithm clusters time-series data faster and more efficiently.
problem Fast clustering of noisy, correlated time-series data.
method Agglomerative Likelihood Clustering (ALC) replaces genetic algorithm with recursive merging.
result ALC reduces compute time and resource usage for large datasets.
Recent empirical studies suggest that the volatility of an underlying price process may have correlations that decay slowly under certain market conditions. In this paper, the volatility is modeled as a stationary process with long-range correlation properties in order to capture such a situation, and we consider Europ…
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.
Correlated topic modeling has been limited to small model and problem sizes due to their high computational cost and poor scaling. In this paper, we propose a new model which learns compact topic embeddings and captures topic correlations through the closeness between the topic vectors. Our method enables efficient inf…
Enhances Fourier estimator performance for asynchronous event-data.
problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.
Gen-Oja efficiently computes principal vectors and canonical correlations in streaming data.
problem Principal Generalized Eigenvector computation and Canonical Correlation Analysis in stochastic settings.
method Gen-Oja is a simple and efficient algorithm that leverages two-time-scale stochastic approximation and fast-mixing Markov chains.
result Gen-Oja achieves optimal convergence rates for these problems.
Paper introduces fast botnet detection from web server logs.
problem Botnets cause various malicious activities; fast detection is needed.
method Inspired by PCA, uses Lanczos method to improve detection speed.
result Lanczos method significantly reduces time complexity for botnet detection.
A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
New methods improve cross-correlation analysis of time series data.
problem Controversies in Multifractal detrended cross-correlation analysis.
method Proposes new options to handle negative cross-covariance.
result Improved robustness in multifractal spectrum analysis.
Calibrates historical and implied correlations in energy markets.
problem Challenges in aligning historical correlations of futures contracts with implied volatility smiles.
method Multiplicative multi-factor Heath-Jarrow-Morton model combined with stochastic volatility from lifted Heston model, using Kemna-Vorst approximation and Fourier-based techniques.
result Remarkable joint historical and implied calibration fits on the German power market.
Automated framework forecasts correlated time series in minutes.
problem Forecasting correlated time series with high accuracy and efficiency.
method Data-driven iterative pruning, zero-shot search, fast parameter adaptation.
result Framework achieves state-of-the-art accuracy and is faster than existing methods.
Multivariate functional data from a complex system are naturally high-dimensional and have complex cross-correlation structure. The complexity of data structure can be observed as that (1) some functions are strongly correlated with similar features, while some others may have almost no cross-correlations with quite di…
Paper offers a fast convergence theory for offline decision making.
problem Offline decision making problems, including reinforcement learning and off-policy evaluation.
method Introduces a framework (DMOF) and algorithm (EDD) with a fast convergence guarantee.
result Demonstrates a fast convergence guarantee with a lower bound complement.
Correlation matrices play a key role in many multivariate methods (e.g., graphical model estimation and factor analysis). The current state-of-the-art in estimating large correlation matrices focuses on the use of Pearson's sample correlation matrix. Although Pearson's sample correlation matrix enjoys various good prop…
We show how Adjoint Algorithmic Differentiation (AAD) allows an extremely efficient calculation of correlation Risk of option prices computed with Monte Carlo simulations. A key point in the construction is the use of binning to simultaneously achieve computational efficiency and accurate confidence intervals. We illus…
Based on the Multifractal Detrended Fluctuation Analysis (MFDFA) and on the Wavelet Transform Modulus Maxima (WTMM) methods we investigate the origin of multifractality in the time series. Series fluctuating according to a qGaussian distribution, both uncorrelated and correlated in time, are used. For the uncorrelated …
Recent empirical studies suggest that the volatilities associated with financial time series exhibit short-range correlations. This entails that the volatility process is very rough and its autocorrelation exhibits sharp decay at the origin. Another classic stylistic feature often assumed for the volatility is that it …
Paper proposes a chi-square test for distance correlation.
problem Testing distance correlation is computationally expensive.
method Proposes a chi-square test for distance correlation, non-parametric, fast, applicable to various metrics.
result Chi-square test exhibits similar power to permutation test and can be valid and universally consistent for testing independence.
Gaussian copulas are widely used in the industry to correlate two random variables when there is no prior knowledge about the co-dependence between them. The perturbed Gaussian copula approach allows introducing the skew information of both random variables into the co-dependence structure. The analytical expression of…
Study fast mean-reversion in large portfolios of stochastic volatility models for accurate loss estimation.
problem Estimating loss from large portfolios of stochastic volatility models with fast mean-reversion.
method Analyzes SPDEs and convergence of stochastic initial-boundary value problems under fast mean-reversion of volatility.
result Accurate estimation of loss distribution using approximate constant volatility models.
Unified CCA methods for large-scale data with fast SGD algorithms.
problem Computational infeasibility of classical CCA methods for large-scale data.
method Unconstrained objective, stochastic gradient descent (SGD) algorithms.
result Significantly faster convergence and higher correlations than previous methods.
Study efficient pricing for barrier options in stochastic-volatility models with leverage correction.
problem Barrier options are sensitive to volatility dynamics, especially leverage, making accurate pricing difficult.
method Developed a class of continuous-path stochastic-clock volatility models and a systematic small-ρ expansion to incorporate leverage.
result Transform-only pricing formulas for barrier derivatives are fast and numerically stable, even for negative leverage.
Improved histogram-based anomaly detector using extended principal component features.
problem Challenges in detecting anomalies in large, correlated datasets.
method Extended histogram-based anomaly detection using principal components.
result Significant improvement in anomaly detection accuracy with no significant increase in runtime.
Quantum-inspired CCA improves correlation analysis for high-dimensional data.
problem High-dimensional data limits conventional CCA due to time complexity.
method Developed a quantum-inspired CCA (qiCCA) with logarithmic time complexity.
result qiCCA extracts more correlations than linear CCA and is comparable to deep and kernel CCA.
We propose a new technique, Singular Vector Canonical Correlation Analysis (SVCCA), a tool for quickly comparing two representations in a way that is both invariant to affine transform (allowing comparison between different layers and networks) and fast to compute (allowing more comparisons to be calculated than with p…
The salient properties of large empirical covariance and correlation matrices are studied for three datasets of size 54, 55 and 330. The covariance is defined as a simple cross product of the returns, with weights that decay logarithmically slowly. The key general properties of the covariance matrices are the following…
Bayesian analysis of financial time series using R-INLA.
problem Analyzing interdependencies between stock volatility measures.
method Flexible level correlated model (LCM) with INLA approximation.
result Fast approximate Bayesian modeling of positive-valued time series.
Exclusive Group Lasso improves feature selection in correlated biological data.
problem Correlated features hinder Lasso performance in biological classification problems.
method Proposes and solves the exclusive group Lasso, combining stability selection and random group allocation.
result Exclusive Group Lasso outperforms Lasso in comprehensive selection of informative features.
This paper describes a flexible and tractable bottom-up dynamic correlation modelling framework with a consistent stochastic recovery specification. The stochastic recovery specification only models the first two moments of the spot recovery rate as its higher moments have almost no contribution to the loss distributio…
Approximate Kernel-based Conditional Independence Tests for Fast Non-Parametric Causal Discoverystat.ME
Constraint-based causal discovery (CCD) algorithms require fast and accurate conditional independence (CI) testing. The Kernel Conditional Independence Test (KCIT) is currently one of the most popular CI tests in the non-parametric setting, but many investigators cannot use KCIT with large datasets because the test sca…