Timezone: »
Talk
How Close Are the Eigenvectors of the Sample and Actual Covariance Matrices?
Andreas Loukas
How many samples are sufficient to guarantee that the eigenvectors of the sample covariance matrix are close to those of the actual covariance matrix? For a wide family of distributions, including distributions with finite second moment and sub-gaussian distributions supported in a centered Euclidean ball, we prove that the inner product between eigenvectors of the sample and actual covariance matrices decreases proportionally to the respective eigenvalue distance and the number of samples. Our findings imply \textit{non-asymptotic} concentration bounds for eigenvectors and eigenvalues and carry strong consequences for the non-asymptotic analysis of PCA and its applications. For instance, they provide conditions for separating components estimated from $O(1)$ samples and show that even few samples can be sufficient to perform dimensionality reduction, especially for low-rank covariances.
Author Information
Andreas Loukas (EPFL)
Related Events (a corresponding poster, oral, or spotlight)
-
2017 Poster: How Close Are the Eigenvectors of the Sample and Actual Covariance Matrices? »
Tue. Aug 8th 08:30 AM -- 12:00 PM Room Gallery #36
More from the Same Authors
-
2023 Poster: Towards Understanding and Improving GFlowNet Training »
Max Shen · Emmanuel Bengio · Ehsan Hajiramezanali · Andreas Loukas · Kyunghyun Cho · Tommaso Biancalani -
2023 Poster: Infusing Lattice Symmetry Priors in Attention Mechanisms for Sample-Efficient Abstract Geometric Reasoning »
Mattia Atzeni · Mrinmaya Sachan · Andreas Loukas -
2022 Poster: SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators »
Karolis Martinkus · Andreas Loukas · NathanaĆ«l Perraudin · Roger Wattenhofer -
2022 Spotlight: SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators »
Karolis Martinkus · Andreas Loukas · NathanaĆ«l Perraudin · Roger Wattenhofer -
2018 Poster: Spectrally Approximating Large Graphs with Smaller Graphs »
Andreas Loukas · Pierre Vandergheynst -
2018 Oral: Spectrally Approximating Large Graphs with Smaller Graphs »
Andreas Loukas · Pierre Vandergheynst -
2018 Poster: Fast Approximate Spectral Clustering for Dynamic Networks »
Lionel Martin · Andreas Loukas · Pierre Vandergheynst -
2018 Oral: Fast Approximate Spectral Clustering for Dynamic Networks »
Lionel Martin · Andreas Loukas · Pierre Vandergheynst