Clustering Market Regimes using the Wasserstein Distance
The problem of rapid and automated detection of distinct market regimes is a topic of great interest to financial mathematicians and practitioners alike. In this paper, we outline an unsupervised learning algorithm for clustering financial time-series into a suitable number of temporal segments (market regimes). As a special case of the above, we develop a robust algorithm that automates the process of classifying market regimes. The method is robust in the sense that it does not depend on modelling assumptions of the underlying time series as our experiments with real datasets show. This method -- dubbed the Wasserstein $k$-means algorithm -- frames such a problem as one on the space of probability measures with finite $p^\text{th}$ moment, in terms of the $p$-Wasserstein distance between (empirical) distributions. We compare our WK-means approach with a more traditional clustering algorithms by studying the so-called maximum mean discrepancy scores between, and within clusters. In both cases it is shown that the WK-means algorithm vastly outperforms all considered competitor approaches. We demonstrate the performance of all approaches both in a controlled environment on synthetic data, and on real data.
Code (1)
Tasks
ClusteringTime SeriesTime Series AnalysisSimilar Papers 제목 키워드 기반
Automated regime detection in multidimensional time series data using sliced Wasserstein k-means clustering
Recent work has proposed Wasserstein k-means (Wk-means) clustering as a powerful method to identify regimes in time series data, and one-dimensional asset returns in particular. In this paper, we begin by studying in det…
ClusteringTime SeriesCollective correlations, dynamics, and behavioural inconsistencies of the cryptocurrency market over time
This paper introduces new methods to study behaviours among the 52 largest cryptocurrencies between 01-01-2019 and 30-06-2021. First, we explore evolutionary correlation behaviours and apply a recently proposed turning p…
Wasserstein Robust Market Making via Entropy Regularization
In this paper, we introduce a robust market making framework based on Wasserstein distance, utilizing a stochastic policy approach enhanced by entropy regularization. We demonstrate that, under mild assumptions, the robu…
Fast Estimation of Wasserstein Distances via Regression on Sliced Wasserstein Distances
We address the problem of efficiently computing Wasserstein distances for multiple pairs of distributions drawn from a meta-distribution. To this end, we propose a fast estimation method based on regressing Wasserstein d…
Point CloudsWasserstein $K$-means for clustering probability distributions
Clustering is an important exploratory data analysis technique to group objects based on their similarity. The widely used $K$-means clustering method relies on some notion of distance to partition data into a fewer numb…
Clustering