MLLGMEMar 16, 2022

High dimensional change-point detection: a complete graph approach

arXiv:2203.08709v13 citationsh-index: 41
Originality Incremental advance
AI Analysis

This work addresses the problem of timely structural break detection in high-dimensional online data for fields like finance, though it is incremental as it builds on graph-based approaches.

The authors tackled the challenge of online change-point detection in high-dimensional data, where existing methods often only test for mean changes and ignore variance changes. They proposed a complete graph-based algorithm that detects both mean and variance changes with high detection power, outperforming other methods, and demonstrated its application on S&P 500 stock data.

The aim of online change-point detection is for a accurate, timely discovery of structural breaks. As data dimension outgrows the number of data in observation, online detection becomes challenging. Existing methods typically test only the change of mean, which omit the practical aspect of change of variance. We propose a complete graph-based, change-point detection algorithm to detect change of mean and variance from low to high-dimensional online data with a variable scanning window. Inspired by complete graph structure, we introduce graph-spanning ratios to map high-dimensional data into metrics, and then test statistically if a change of mean or change of variance occurs. Theoretical study shows that our approach has the desirable pivotal property and is powerful with prescribed error probabilities. We demonstrate that this framework outperforms other methods in terms of detection power. Our approach has high detection power with small and multiple scanning window, which allows timely detection of change-point in the online setting. Finally, we applied the method to financial data to detect change-points in S&P 500 stocks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes