arXiv research

We propose a group model for correlations in stock markets. In the group model the markets are composed of several groups, within which the stock price fluctuations are correlated. The spectral properties of empirical correlation matrices reported in [Phys. Rev. Lett. {\bf 83}, 1467 (1999); Phys. Rev. Lett. {\bf 83}, 1…

DynMSA detects market clusters for better portfolio allocation.

New method detects and analyzes correlation in multiple network data.

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…

Spectral denoising recovers meaningful network structure from noisy financial correlations.

New methods rank players using covariates and comparisons, outperforming existing algorithms.

We analyze the spectral properties of correlation matrices between distinct statistical systems. Such matrices are intrinsically non symmetric, and lend themselves to extend the spectral analyses usually performed on standard Pearson correlation matrices to the realm of complex eigenvalues. We employ some recent random…

Estimates linear model from noisy covariates and instruments using spectral regularization.

Study uses detrended cross-correlation to analyze cryptocurrency market, revealing robust collective modes and distinguishing interdependencies.

In this work, the possibility of clustering correlated random variables was examined, both because of their mutual similarity and because of their similarity to the principal components. The k-means algorithm and spectral algorithms were used for clustering. For spectral methods, the similarity matrix was both the matr…

New method embeds correlation networks to reveal underlying time series patterns.

New kernel models multi-output Gaussian processes accurately.

FASC clusters data with latent factors, improving on naive methods.

Cryptocurrency market becomes more cross-correlated over time.

We investigate serial correlation, periodic, aperiodic and scaling behaviour of eigenmodes, i.e. daily price fluctuation time-series derived from eigenvectors, of correlation matrices of shares listed on the Johannesburg Stock Exchange (JSE) from January 1993 to December 2002. Periodic, or calendar, components are dete…

This paper proves a generalization bound for complex-valued neural networks scaling with spectral complexity.

New method clusters evolving networks using spatio-temporal graph Laplacian.

Introduces Spectral Attention for better long-range time series forecasting.

Study precise estimators for correlated data using RDT.

We prove exponential decay of correlations for Hölder continuous observables with respect to any Gibbs measure for contact Anosov flows admitting Pesin sets with exponentially small tails. This is achieved by establishing strong spectral estimates for certain Ruelle transfer operators for such flows.

In this paper, we propose a new measure to gauge the complexity of image classification problems. Given an annotated image dataset, our method computes a complexity measure called the cumulative spectral gradient (CSG) which strongly correlates with the test accuracy of convolutional neural networks (CNN). The CSG meas…

Spectral methods improve parameter estimation in structured GLMs.

We solve matrix denoising with both row and column correlations, setting limits and designing optimal methods.

In phase retrieval we want to recover an unknown signal $\boldsymbol x\in\mathbb C^d$ from $n$ quadratic measurements of the form $y_i = |\langle{\boldsymbol a}_i,{\boldsymbol x}\rangle|^2+w_i$ where $\boldsymbol a_i\in \mathbb C^d$ are known sensing vectors and $w_i$ is measurement noise. We ask the following weak rec…

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

We give a simple explicit formula for turnover reduction when a large number of alphas are traded on the same execution platform and trades are crossed internally. We model turnover reduction via alpha correlations. Then, for a large number of alphas, turnover reduction is related to the largest eigenvalue and the corr…

We show that the Kullback-Leibler distance is a good measure of the statistical uncertainty of correlation matrices estimated by using a finite set of data. For correlation matrices of multivariate Gaussian variables we analytically determine the expected values of the Kullback-Leibler distance of a sample correlation …

We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edge-correlated weighted graphs. Extending the exact recovery guarantees established in the companion paper for Gaussian weights, in this work,…

Study of correlated Wigner matrices with BBP transitions.

The aim of this work is to build financial crisis indicators based on spectral properties of the dynamics of market data. After choosing an optimal size for a rolling window, the historical market data in this window is seen every trading day as a random matrix from which a covariance and a correlation matrix are obtai…

Stock price change in financial market occurs through transactions in analogy with diffusion in stochastic physical systems. The analysis of price changes in real markets shows that long-range correlations of price fluctuations largely depend on the number of transactions. We introduce the multiplicative stochastic mod…

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…

A new convolutional spectral kernel network learns hierarchical and local features.

A new method for nonstationary Gaussian processes using Fourier features.

This paper presents a margin-based multiclass generalization bound for neural networks that scales with their margin-normalized "spectral complexity": their Lipschitz constant, meaning the product of the spectral norms of the weight matrices, times a certain correction factor. This bound is empirically investigated for…

Deep learning explained through spectral filtering of hierarchical features.

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…

CNN model for efficient wireless spectrum sensing and signal identification.

The problem of filtering information from large correlation matrices is of great importance in many applications. We have recently proposed the use of the Kullback-Leibler distance to measure the performance of filtering algorithms in recovering the underlying correlation matrix when the variables are described by a mu…

GWCA analyzes cross-graph correlations for movie retrieval.

New non-separable covariance kernels for spatiotemporal data derived from harmonic oscillator physics.

The correlation matrix is the key element in optimal portfolio allocation and risk management. In particular, the eigenvectors of the correlation matrix corresponding to large eigenvalues can be used to identify the market mode, sectors and style factors. We investigate how these eigenvalues depend on the time scale of…

In this paper, we propose guaranteed spectral methods for learning a broad range of topic models, which generalize the popular Latent Dirichlet Allocation (LDA). We overcome the limitation of LDA to incorporate arbitrary topic correlations, by assuming that the hidden topic proportions are drawn from a flexible class o…

We investigate the possible drawbacks of employing the standard Pearson estimator to measure correlation coefficients between financial stocks in the presence of non-stationary behavior, and we provide empirical evidence against the well-established common knowledge that using longer price time series provides better, …

A fast spectral algorithm detects community structure in evolving graphs.

We apply random matrix theory to compare correlation matrix estimators C obtained from emerging market data. The correlation matrices are constructed from 10 years of daily data for stocks listed on the Johannesburg Stock Exchange (JSE) from January 1993 to December 2002. We test the spectral properties of C against ra…

Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we propose a new spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA)…

Deep convolutional neural networks (CNNs) have been shown to be able to fit a random labeling over data while still being able to generalize well for normal labels. Describing CNN capacity through a posteriori measures of complexity has been recently proposed to tackle this apparent paradox. These complexity measures a…