Non-parametric online market regime detection and regime clustering for multidimensional and path-dependent data structures
Not on the map. Why?
Abstract (arXiv)
In this work we present a non-parametric online market regime detection method for multidimensional data structures using a path-wise two-sample test derived from a maximum mean discrepancy-based similarity metric on path space that uses rough path signatures as a feature map. The latter similarity metric has been developed and applied as a discriminator in recent generative models for small data environments, and has been optimised here to the setting where the size of new incoming data is particularly small, for faster reactivity. On the same principles, we also present a path-wise method for regime clustering which extends our previous work. The presented regime clustering techniques were designed as ex-ante market analysis tools that can identify periods of approximatively similar market activity, but the new results also apply to path-wise, high dimensional-, and to non-Markovian settings as well as to data structures that exhibit autocorrelation. We demonstrate our clustering tools on easily verifiable synthetic datasets of increasing complexity, and also show how the outlined regime detection techniques can be used as fast on-line automatic regime change detectors or as outlier detection tools, including a fully automated pipeline. Finally, we apply the fine-tuned algorithms to real-world historical data including high-dimensional baskets of equities and the recent price evolution of crypto assets, and we show that our methodology swiftly and accurately indicated historical periods of market turmoil.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 69 references that are in the map. First posted on arXiv 27 Jun 2023.
Builds on
24 of 69 references.
References · 24
- 2016Revisiting Classifier Two-Sample Testscited by 268
- 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 254
- 2019Generalized Sliced Wasserstein Distancescited by 208
- 2021Understanding Failures in Out-of-Distribution Detection with Deep Generative Modelscited by 89
- 2021Sig-Wasserstein GANs for Time Series Generationcited by 60
- 2020The Signature Kernel is the solution of a Goursat PDEcited by 58
- 2018Signature moments to characterize laws of stochastic processescited by 56
- 2019Statistical Inference for Generative Models with Maximum Mean Discrepancycited by 45
- 2019Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distancecited by 43
- 2016Kernel Distribution Embeddings: Universal Kernels, Characteristic Kernels and Kernel Metrics on Distributionscited by 40
- 2023Non-adversarial training of Neural SDEs with signature kernel scorescited by 37
- 2020A Data-driven Market Simulator for Small Data Environmentscited by 35
12 more
- 2020Distribution Regression for Sequential Datacited by 31
- 2013A Nonparametric Approach for Multiple Change Point Analysis of Multivariate Datacited by 28
- 2021Higher Order Kernel Mean Embeddings to Capture Filtrations of Stochastic Processescited by 27
- 2019Deep Hedging: Learning to Simulate Equity Option Marketscited by 25
- 2019Finite sample properties of parametric MMD estimation: robustness to misspecification and dependencecited by 25
- 2020On the Convergence of Gradient Descent in GANs: MMD GAN As a Gradient Flowcited by 21
- 2022Random Forests for Change Point Detectioncited by 14
- 2019On the Use of Random Forest for Two-Sample Testingcited by 13
- 2018Selective review of offline change point detection methodscited by 8
- 2020Dimensionless Anomaly Detection on Multivariate Streams with Variance Norm and Path Signaturecited by 8
- 2021Clustering Market Regimes using the Wasserstein Distancecited by 4
- 2021Graph-based multiple change-point detectioncited by 2
Built on by
Citing papers per year: 2023: 2.
2 papers.