English

Sequential detection of low-rank changes using extreme eigenvalues

Statistics Theory 2017-06-16 v1 Machine Learning Statistics Theory

Abstract

We study the problem of detecting an abrupt change to the signal covariance matrix. In particular, the covariance changes from a "white" identity matrix to an unknown spiked or low-rank matrix. Two sequential change-point detection procedures are presented, based on the largest and the smallest eigenvalues of the sample covariance matrix. To control false-alarm-rate, we present an accurate theoretical approximation to the average-run-length (ARL) and expected detection delay (EDD) of the detection, leveraging the extreme eigenvalue distributions from random matrix theory and by capturing a non-negligible temporal correlation in the sequence of scan statistics due to the sliding window approach. Real data examples demonstrate the good performance of our method for detecting behavior change of a swarm.

Keywords

Cite

@article{arxiv.1706.04729,
  title  = {Sequential detection of low-rank changes using extreme eigenvalues},
  author = {Liyan Xie and Yao Xie},
  journal= {arXiv preprint arXiv:1706.04729},
  year   = {2017}
}

Comments

Submitted

R2 v1 2026-06-22T20:19:22.259Z