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.
We relax indicator matrices to form a manifold for faster optimization.
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…
We analyzed cross-correlations between price fluctuations of global financial indices (20 daily stock indices over the world) and local indices (daily indices of 200 companies in the Korean stock market) by using random matrix theory (RMT). We compared eigenvalues and components of the largest and the second largest ei…
The problem of low-rank matrix completion has recently generated a lot of interest leading to several results that offer exact solutions to the problem. However, in order to do so, these methods make assumptions that can be quite restrictive in practice. More specifically, the methods assume that: a) the observed indic…
A very simple interpretation of matrix completion problem is introduced based on statistical models. Combined with the well-known results from missing data analysis, such interpretation indicates that matrix completion is still a valid and principled estimation procedure even without the missing completely at random (M…
Reconstruction based subspace clustering methods compute a self reconstruction matrix over the samples and use it for spectral clustering to obtain the final clustering result. Their success largely relies on the assumption that the underlying subspaces are independent, which, however, does not always hold in the appli…
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.
Effective Gram matrix predicts deep network generalization.
The CN matrix of a pure braid projection is characterized and applied.
With the random matrix theory, we study the spatial structure of the Chinese stock market, American stock market and global market indices. After taking into account the signs of the components in the eigenvectors of the cross-correlation matrix, we detect the subsector structure of the financial systems. The positive …
The cross-correlation matrix of daily returns of stock market indices in a diverse set of 37 countries worldwide was analyzed. Comparison of the spectrum of this matrix with predictions of random matrix theory provides an empirical evidence of strong interactions between individual economies, as manifested by three lar…
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…
Invariants defined for braid systems under Hurwitz equivalence.
The successive projection algorithm (SPA) is a fast algorithm to tackle separable nonnegative matrix factorization (NMF). Given a nonnegative data matrix , SPA identifies an index set such that there exists a nonnegative matrix with . SPA has been successfully used as a…
EDAs with matrix transpose improve Bayesian structure learning performance.
We propose a new notion of `non-linearity' of a network layer with respect to an input batch that is based on its proximity to a linear system, which is reflected in the non-negative rank of the activation matrix. We measure this non-linearity by applying non-negative factorization to the activation matrix. Considering…
This paper concerns the problem of matrix completion, which is to estimate a matrix from observations in a small subset of indices. We propose a calibrated spectrum elastic net method with a sum of the nuclear and Frobenius penalties and develop an iterative algorithm to solve the convex minimization problem. The itera…
We investigated the topological properties of stock networks through a comparison of the original stock network with the estimated stock network from the correlation matrix created by the random matrix theory (RMT). We used individual stocks traded on the market indices of Korea, Japan, Canada, the USA, Italy, and the …
The aim of this work is to create systematic trading strategies built upon several financial crisis indicators based on the spectral properties of market dynamics. Within the limitations of our framework and data, we will demonstrate that our systematic trading strategies are able to make money, not as a result of pure…
We analyse the structure of the distribution of eigenvalues of the stock market correlation matrix with increasing length of the time series representing the price changes. We use 100 highly-capitalized stocks from the American market and relate result to the corresponding ensemble of Wishart random matrices. It turns …
Random matrix analysis reveals that neural network weights are mostly random, with some indicating learned information.
We use Random Matrix Theory (RMT) and information theory to analyze the correlations and flow of information between 64,939 news from The New York Times and 40 world financial indices during 10 months along the period 2015-2016. The set of news was quantified and transformed into daily polarity time series using tools …
We show how random matrix theory can be applied to develop new algorithms to extract dynamic factors from macroeconomic time series. In particular, we consider a limit where the number of random variables N and the number of consecutive time measurements T are large but the ratio N / T is fixed. In this regime the unde…
Many similarity-based clustering methods work in two separate steps including similarity matrix computation and subsequent spectral clustering. However, similarity measurement is challenging because it is usually impacted by many factors, e.g., the choice of similarity metric, neighborhood size, scale of data, noise an…
A widespread approach in machine learning to evaluate the quality of a classifier is to cross -- classify predicted and actual decision classes in a confusion matrix, also called error matrix. A classification tool which does not assume distributional parameters but only information contained in the data is based on th…
An NMT system for Indic languages outperforms Google Translate.
Paper proposes a new GPR-HS framework for accurate VCV estimation in global equity indices.
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…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of…
Proposes SAG-DBSCAN for clustering with self-adaptation.
We propose a modified time lag random matrix theory in order to study time lag cross-correlations in multiple time series. We apply the method to 48 world indices, one for each of 48 different countries. We find long-range power-law cross-correlations in the absolute values of returns that quantify risk, and find that …
Community detection is a fundamental task in social network analysis. In this paper, first we develop an endorsement filtered user connectivity network by utilizing Heider's structural balance theory and certain Twitter triad patterns. Next, we develop three Nonnegative Matrix Factorization frameworks to investigate th…
The paper improves Bayesian precision matrix estimation for high-dimensional sparse data.
UA-LQE improves value function learning by selectively erasing uncertain entries in Q-matrix.
Social trust prediction addresses the significant problem of exploring interactions among users in social networks. Naturally, this problem can be formulated in the matrix completion framework, with each entry indicating the trustness or distrustness. However, there are two challenges for the social trust problem: 1) t…
The paper addresses ill-conditioning in large spatial data, proposing solutions for prediction and likelihood estimation.
Novel risk matrix for optimal portfolio choice with tail risk considerations.
Active learning aims to obtain a classifier of high accuracy by using fewer label requests in comparison to passive learning by selecting effective queries. Many active learning methods have been developed in the past two decades, which sample queries based on informativeness or representativeness of unlabeled data poi…
We find a novel correlation structure in the residual noise of stock market returns that is remarkably linked to the composition and stability of the top few significant factors driving the returns, and moreover indicates that the noise band is composed of multiple subbands that do not fully mix. Our findings allow us …
New method estimates missingness probabilities for MNAR matrix completion.
Using a data set which includes all transactions among banks in the Italian money market, we study their trading strategies and the dependence among them. We use the Fourier method to compute the variance-covariance matrix of trading strategies. Our results indicate that well defined patterns arise. Two main communitie…
Graph neural networks improve SME credit risk assessment.
This work studies low-rank approximation of a positive semidefinite matrix from partial entries via nonconvex optimization. We characterized how well local-minimum based low-rank factorization approximates a fixed positive semidefinite matrix without any assumptions on the rank-matching, the condition number or eigensp…
A method to analyze neural network performance by measuring layer saturation.
BeMF improves recommendation reliability in recommender systems.
New method estimates sparse covariance matrices in logit mixtures.
The paper introduces a penalized matrix estimation procedure aiming at solutions which are sparse and low-rank at the same time. Such structures arise in the context of social networks or protein interactions where underlying graphs have adjacency matrices which are block-diagonal in the appropriate basis. We introduce…
Paper proposes a new method to improve clustering ensemble performance.