Learning Undirected Graphs in Financial Markets

We investigate the problem of learning undirected graphical models under Laplacian structural constraints from the point of view of financial market data. We show that Laplacian constraints have meaningful physical interpretations related to the market index factor and to the conditional correlations between stocks. Those interpretations lead to a set of guidelines that users should be aware of when estimating graphs in financial markets. In addition, we propose algorithms to learn undirected graphs that account for stylized facts and tasks intrinsic to financial data such as non-stationarity and stock clustering.

[1]  Caroline Uhler,et al.  Covariance Matrix Estimation under Total Positivity for Portfolio Selection* , 2019, 1909.04222.

[2]  K. Fan.  On a Theorem of Weyl Concerning Eigenvalues of Linear Transformations I. , 1949, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Vassilis Kalofolias,et al.  How to Learn a Graph from Smooth Signals , 2016, AISTATS.

[4]  Vincent Y. F. Tan,et al.  High-dimensional Gaussian graphical model selection: walk summability and local separation criterion , 2011, J. Mach. Learn. Res..

[5]  Levent Tunçel,et al.  Optimization algorithms on matrix manifolds , 2009, Math. Comput..

[6]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[7]  Yuichi Tanaka,et al.  Time-Varying Graph Learning with Constraints on Graph Temporal Variation , 2020, ArXiv.

[8]  Feiping Nie,et al.  The Constrained Laplacian Rank Algorithm for Graph-Based Clustering , 2016, AAAI.

[9]  Licheng Zhao,et al.  Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM , 2019, IEEE Transactions on Signal Processing.

[10]  Sandeep Kumar,et al.  A Unified Framework for Structured Graph Learning via Spectral Constraints , 2019, J. Mach. Learn. Res..

[11]  Yuhao Wang,et al.  Learning High-dimensional Gaussian Graphical Models under Total Positivity without Adjustment of Tuning Parameters , 2020, AISTATS.

[12]  Prabhu Babu,et al.  Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning , 2017, IEEE Transactions on Signal Processing.

[13]  Joshua B. Tenenbaum,et al.  Discovering Structure by Learning Sparse Graphs , 2010 .

[14]  Antonio Ortega,et al.  Graph Learning From Data Under Laplacian and Structural Constraints , 2016, IEEE Journal of Selected Topics in Signal Processing.

[15]  Frank Nielsen,et al.  A Review of Two Decades of Correlations, Hierarchies, Networks and Clustering in Financial Markets , 2017, Signals and Communication Technology.

[16]  Stephen P. Boyd,et al.  CVXPY: A Python-Embedded Modeling Language for Convex Optimization , 2016, J. Mach. Learn. Res..

[17]  Pascal Frossard,et al.  Learning Laplacian Matrix in Smooth Graph Signal Representations , 2014, IEEE Transactions on Signal Processing.

[18]  Daniel Pérez Palomar,et al.  Structured Graph Learning Via Laplacian Spectral Constraints , 2019, NeurIPS.

[19]  Pascal Frossard,et al.  Learning time varying graphs , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[20]  Oliver Knill,et al.  Cauchy-Binet for Pseudo-Determinants , 2013, 1306.0062.