Permutation invariant Gaussian matrix models for financial correlation matrices
We construct an ensemble of correlation matrices from high-frequency foreign exchange market data, with one matrix for every day for 446 days. The matrices are symmetric and have vanishing diagonal elements after subtracting the identity matrix. For this case, we construct the general permutation invariant Gaussian matrix model, which has 4 parameters characterised using the representation theory of symmetric groups. The permutation invariant polynomial functions of the symmetric, diagonally vanishing matrices have a basis labelled by undirected loop-less graphs. Using the expectation values of the general linear and quadratic permutation invariant functions of the matrices in the dataset, the 4 parameters of the matrix model are determined. The model then predicts the expectation values of the cubic and quartic polynomials. These predictions are compared to the data to give strong evidence for a good overall fit of the permutation invariant Gaussian matrix model. The linear, quadratic, cubic and quartic polynomial functions are then used to define low-dimensional feature vectors for the days associated to the matrices. These vectors, with choices informed by the refined structure of small non-Gaussianities, are found to be effective as a tool for anomaly detection in market states: statistically significant correlations are established between atypical days as defined using these feature vectors, and days with significant economic events as recognized in standard foreign exchange economic calendars. They are also shown to be useful as a tool for ranking pairs of days in terms of their similarity, yielding a strongly statistically significant correlation with a ranking based on a higher dimensional proxy for visual similarity.
Code (0)
등록된 구현이 없습니다.
Tasks
Anomaly DetectionSimilar Papers 제목 키워드 기반
Gaussianity and typicality in matrix distributional semantics
Constructions in type-driven compositional distributional semantics associate large collections of matrices of size $D$ to linguistic corpora. We develop the proposal of analysing the statistical characteristics of this …
Permutation Invariant Gaussian Matrix Models
Permutation invariant Gaussian matrix models were recently developed for applications in computational linguistics. A 5-parameter family of models was solved. In this paper, we use a representation theoretic approach to …
Approximate Gaussianity Beyond Initialisation in Neural Networks
Ensembles of neural network weight matrices are studied through the training process for the MNIST classification problem, testing the efficacy of matrix models for representing their distributions, under assumptions of …
Permutation invariant matrix statistics and computational language tasks
The Linguistic Matrix Theory programme introduced by Kartsaklis, Ramgoolam and Sadrzadeh is an approach to the statistics of matrices that are generated in type-driven distributional semantics, based on permutation invar…
Going Deeper into Permutation-Sensitive Graph Neural Networks
The invariance to permutations of the adjacency matrix, i.e., graph isomorphism, is an overarching requirement for Graph Neural Networks (GNNs). Conventionally, this prerequisite can be satisfied by the invariant operati…