Robust Quickest Correlation Change Detection in High-Dimensional Random Vectors
Assma Alghamdi, Taposh Banerjee, and Jayant Rajgopal

TL;DR
This paper presents a robust, computationally efficient algorithm for detecting correlation changes in high-dimensional data, capable of handling unknown and time-varying post-change distributions.
Contribution
It introduces a novel correlation change detection method based on the maximum correlation coefficient's asymptotic density, improving robustness and efficiency.
Findings
Effective in simulated data scenarios
Handles unknown and time-varying post-change distributions
Computationally efficient for high-dimensional data
Abstract
Detecting changes in high-dimensional vectors presents significant challenges, especially when the post-change distribution is unknown and time-varying. This paper introduces a novel robust algorithm for correlation change detection in high-dimensional data. The approach utilizes the summary statistic of the maximum magnitude correlation coefficient to detect the change. This summary statistic captures the level of correlation present in the data but also has an asymptotic density. The robust test is designed using the asymptotic density. The proposed approach is robust because it can help detect a change in correlation level from some known level to unknown, time-varying levels. The proposed test is also computationally efficient and valid for a broad class of data distributions. The effectiveness of the proposed algorithm is demonstrated on simulated data.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques
