Market Graph Clustering Via QUBO and Digital Annealing

06/18/2020
by   Seo Hong, et al.
0

Our goal is to find representative nodes of a market graph that best replicate the returns of a broader market graph (index), a common task in the financial industry. We model our reference index as a market graph and express the index tracking problem in a quadratic K-medoids form. We take advantage of a purpose built hardware architecture, the Fujitsu Digital Annealer, to circumvent the NP-hard nature of the problem and solve our formulation efficiently. In this article, we combine three separate areas of the literature, market graph models, K-medoid clustering and quadratic binary optimization modeling, to formulate the index-tracking problem as a quadratic K-medoid graph-clustering problem. Our initial results show we accurately replicate the returns of a broad market index, using only a small subset of its constituent assets. Moreover, our quadratic formulation allows us to take advantage of recent hardware advances, to overcome the NP-hard nature of the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2020

Graph Clustering Via QUBO and Digital Annealing

This article empirically examines the computational cost of solving a kn...
research
06/02/2023

A systematic literature review on solution approaches for the index tracking problem in the last decade

The passive management approach offers conservative investors a way to r...
research
08/21/2019

Myopic robust index tracking with Bregman divergence

Index tracking is a popular form of asset management. Typically, a quadr...
research
09/02/2022

Index Tracking via Learning to Predict Market Sensitivities

A significant number of equity funds are preferred by index funds nowada...
research
01/01/2019

A Field-Size Independent Code Construction for Groupcast Index Coding Problems

The length of an optimal scalar linear index code of a groupcast index c...
research
08/27/2020

Hybrid quantum-classical optimization for financial index tracking

Tracking a financial index boils down to replicating its trajectory of r...
research
09/08/2022

Quantum Sparse Coding

The ultimate goal of any sparse coding method is to accurately recover f...

Please sign up or login with your details

Forgot password? Click here to reset