Sequential Eigenvalue Statistics for Change-Point Detection in Covariance Matrices
Nina D\"ornemann, Holger Dette

TL;DR
This paper introduces a new statistical method for detecting change points in sequences of covariance matrices, especially effective in high-dimensional settings, by using a sequential likelihood ratio process and asymptotic analysis.
Contribution
It develops a novel change-point detection approach based on eigenvalue statistics with theoretical guarantees in high-dimensional regimes.
Findings
Proves weak convergence of the test statistic to a Gaussian process under null hypothesis
Provides asymptotic critical values for change-point tests in high dimensions
Demonstrates effectiveness through theoretical analysis and simulations
Abstract
Testing for change points in sequences of covariance matrices is an important and equally challenging problem in statistical methodology with applications in various fields. Motivated by the observation that even in cases where the ratio between dimension and sample size is as small as , tests based on a fixed-dimension asymptotics do not keep their preassigned level, we propose to derive critical values of test statistics using an asymptotic regime where the dimension diverges at the same rate as the sample size. This paper introduces a novel and well-founded statistical methodology for detecting change points in a sequence of moderately dimensional covariance matrices. Our approach utilizes a min-type statistic based on a sequential process of likelihood ratio statistics. This is used to construct a test for the hypothesis of the existence of a change point with a…
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
TopicsStatistical and numerical algorithms
