Robust Quickest Correlation Change Detection in High-Dimensional Random Vectors

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Alghamdi, Assma, Banerjee, Taposh, Rajgopal, Jayant
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913532123021312
author Alghamdi, Assma
Banerjee, Taposh
Rajgopal, Jayant
author_facet Alghamdi, Assma
Banerjee, Taposh
Rajgopal, Jayant
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2410_03593
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Robust Quickest Correlation Change Detection in High-Dimensional Random Vectors
Alghamdi, Assma
Banerjee, Taposh
Rajgopal, Jayant
Methodology
Signal Processing
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.
title Robust Quickest Correlation Change Detection in High-Dimensional Random Vectors
topic Methodology
Signal Processing
url https://arxiv.org/abs/2410.03593