mlsanityData to 7 Oct 2026

Large-scale Time-Varying Portfolio Optimisation using Graph Attention Networks

arXiv 2407.15532 ↗First posted 22 Jul 2024q-fin.PM cs.AI cs.SIcited by 1

Not on the map. Why?

Abstract (arXiv)

Apart from assessing individual asset performance, investors in financial markets also need to consider how a set of firms performs collectively as a portfolio. Whereas traditional Markowitz-based mean-variance portfolios are widespread, network-based optimisation techniques offer a more flexible tool to capture complex interdependencies between asset values. However, most of the existing studies do not contain firms at risk of default and remove any firms that drop off indices over a certain time. This is the first study to also incorporate such firms in portfolio optimisation on a large scale. We propose and empirically test a novel method that leverages Graph Attention networks (GATs), a subclass of Graph Neural Networks (GNNs). GNNs, as deep learning-based models, can exploit network data to uncover nonlinear relationships. Their ability to handle high-dimensional data and accommodate customised layers for specific purposes makes them appealing for large-scale problems such as mid- and small-cap portfolio optimisation. This study utilises 30 years of data on mid-cap firms, creating graphs of firms using distance correlation and the Triangulated Maximally Filtered Graph approach. These graphs are the inputs to a GAT model incorporating weight and allocation constraints and a loss function derived from the Sharpe ratio, thus focusing on maximising portfolio risk-adjusted returns. This new model is benchmarked against a network characteristic-based portfolio, a mean variance-based portfolio, and an equal-weighted portfolio. The results show that the portfolio produced by the GAT-based model outperforms all benchmarks and is consistently superior to other strategies over a long period, while also being informative of market dynamics.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 71 references that are in the map. First posted on arXiv 22 Jul 2024.

Builds on

15 of 71 references.

References · 15

  1. 2017Attention Is All You Needcited by 59,932
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  5. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  6. 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
  7. 2018Link Prediction Based on Graph Neural Networkscited by 829
  8. 2019Graph Neural Networks for Social Recommendationcited by 711
  9. 2016Interaction Networks for Learning about Objects, Relations and Physicscited by 503
  10. 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 337
  11. 2015Network Filtering for Big Data: Triangulated Maximally Filtered Graphcited by 17
  12. 2014Fast Computing for Distance Covariancecited by 13
3 more
  1. 2018A Scalable Algorithm For Sparse Portfolio Selectioncited by 8
  2. 2020Multilayer Network Analysis for Improved Credit Risk Predictioncited by 8
  3. 2021A transformer-based model for default prediction in mid-cap corporate marketscited by 6

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.