Testing for Principal Component Directions under Weak Identifiability
Davy Paindaveine, Julien Remy, Thomas Verdebout

TL;DR
This paper examines the limitations of classical tests for principal component directions under weak identifiability, proposing a more robust testing approach that maintains correct size and power in challenging asymptotic scenarios.
Contribution
It introduces a new understanding of the behavior of likelihood ratio and Le Cam optimal tests under weak eigenvalue separation, advocating for the latter in such cases.
Findings
Le Cam optimal test maintains nominal level under weak identifiability.
Likelihood ratio test overrejects when eigenvalues are close.
The new test is robust and retains power in challenging asymptotic regimes.
Abstract
We consider the problem of testing, on the basis of a -variate Gaussian random sample, the null hypothesis against the alternative , where is the "first" eigenvector of the underlying covariance matrix and is a fixed unit -vector. In the classical setup where eigenvalues are fixed, the Anderson (1963) likelihood ratio test (LRT) and the Hallin, Paindaveine and Verdebout (2010) Le Cam optimal test for this problem are asymptotically equivalent under the null hypothesis, hence also under sequences of contiguous alternatives. We show that this equivalence does not survive asymptotic scenarios where with . For such scenarios, the Le Cam optimal…
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.
