Sharp minimax tests for large covariance matrices and adaptation
Cristina Butucea, Rania Zgheib

TL;DR
This paper develops sharp minimax tests for detecting correlations in high-dimensional Gaussian vectors, establishing optimal rates and constructing adaptive procedures for large covariance matrices.
Contribution
It introduces a new U-statistic based test with optimal weights, providing asymptotic and sharp minimax separation rates, and extends results to inverse covariance matrix testing.
Findings
Test statistic is asymptotically Gaussian under null and alternative hypotheses.
Derived sharp minimax separation rates for different smoothness parameters.
Constructed adaptive test procedures that attain near-optimal rates.
Abstract
We consider the detection problem of correlations in a -dimensional Gaussian vector, when we observe independent, identically distributed random vectors, for and large. We assume that the covariance matrix varies in some ellipsoid with parameter and total energy bounded by . We propose a test procedure based on a U-statistic of order 2 which is weighted in an optimal way. The weights are the solution of an optimization problem, they are constant on each diagonal and non-null only for the first diagonals, where . We show that this test statistic is asymptotically Gaussian distributed under the null hypothesis and also under the alternative hypothesis for matrices close to the detection boundary. We prove upper bounds for the total error probability of our test procedure, for and under the assumption which implies that…
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.
