Bayesian inference for spectral projectors of the covariance matrix
arXiv:1711.11532 · doi:10.1214/18-EJS1451
Abstract
Let be i.i.d. sample in with zero mean and the covariance matrix . The classical PCA approach recovers the projector onto the principal eigenspace of by its empirical counterpart . Recent paper [Koltchinskii, Lounici (2017)] investigated the asymptotic distribution of the Frobenius distance between the projectors , while [Naumov et al. (2017)] offered a bootstrap procedure to measure uncertainty in recovering this subspace even in a finite sample setup. The present paper considers this problem from a Bayesian perspective and suggests to use the credible sets of the pseudo-posterior distribution on the space of covariance matrices induced by the conjugated Inverse Wishart prior as sharp confidence sets. This yields a numerically efficient procedure. Moreover, we theoretically justify this method and derive finite sample bounds on the corresponding coverage probability. Contrary to [Koltchinskii, Lounici (2017), Naumov et al. (2017)], the obtained results are valid for non-Gaussian data: the main assumption that we impose is the concentration of the sample covariance in a vicinity of . Numerical simulations illustrate good performance of the proposed procedure even on non-Gaussian data in a rather challenging regime.
arXiv comment40 pages, 2 figures, accepted version
References in corpus (13)
- User-friendly tail bounds for sums of random matrices
- Sparse PCA: Optimal rates and adaptive estimation
- Optimal detection of sparse principal components in high dimension
- Tracy--Widom limit for the largest eigenvalue of a large class of complex sample covariance matrices
- High Dimensional Statistical Inference and Random Matrices
- Quantitative estimates of the convergence of the empirical covariance matrix in Log-concave Ensembles
- Nonparametric Bernstein-von Mises theorems in Gaussian white noise
- Normal approximation and concentration of spectral projectors of sample covariance
- The semiparametric Bernstein-von Mises theorem
- A Bernstein-von Mises theorem for smooth functionals in semiparametric models
- Rate-optimal posterior contraction for sparse PCA
- Principal component analysis for big data
- Estimation of functionals of sparse covariance matrices