← Search

Ljubisa Stankovic

6 accepted papers

2023

Hierarchical Graph Learning for Stock Market Prediction Via a Domain-Aware Graph Pooling Operator

ICASSP 2023accepted

The utility of Graph Neural Networks (GNN) for the paradigm of forecasting short-term stock price movements is investigated. In particular, a finance-specific graph pooling operation, referred to as StockPool, is introduced to efficiently coarsen the stock graph. This is achieved by employing domain…

Cited by 0SourceScholar
2022

Dynamic Portfolio Cuts: A Spectral Approach to Graph-Theoretic Diversification

ICASSP 2022accepted

Stock market returns are typically analyzed using standard regression models yet they reside on irregular domains, a natural scenario for graph signal processing. This motivates us to consider a market graph as an intuitive way to represent the relationships between financial assets. Traditional met…

Cited by 0SourceScholar
2022

Low-Complexity Attention Modelling via Graph Tensor Networks

ICASSP 2022accepted

The attention mechanism is at the core of modern Natural Language Processing (NLP) models, owing to its ability to focus on the most contextually relevant part of a sequence. However, current attention models rely on "flat-view" matrix methods to process tokens embedded in vector spaces; this result…

Cited by 0SourceScholar
2021

Nonstationary Portfolios: Diversification in the Spectral Domain

ICASSP 2021accepted

Classical portfolio optimization methods typically determine an optimal capital allocation through the implicit, yet critical, assumption of statistical time-invariance. Such models are inadequate for real-world markets as they employ standard time-averaging based estimators which suffer significant…

Cited by 0SourceScholar
2020

A Low-Dimensionality Method for Data-Driven Graph Learning

ICASSP 2020accepted

In many graph signal processing applications, finding the topology of a graph is part of the overall data processing problem rather than a priori knowledge. Most of the approaches to graph topology learning are based on the assumption of graph Laplacian sparsity, with various additional constraints,…

Cited by 0SourceScholar
2020

Portfolio Cuts: A Graph-Theoretic Framework to Diversification

ICASSP 2020accepted

Investment returns naturally reside on irregular domains, however, standard multivariate portfolio optimization methods are agnostic to data structure. To this end, we investigate ways for domain knowledge to be conveniently incorporated into the analysis, by means of graphs. Next, to relax the assu…

Cited by 0SourceScholar